Well, that’s all folks!

Well, that’s all folks!
My last exam A Level is now out of the way, unless I end up retaking a year, which given my epic maths failures recently wouldn’t surprise me.

Now I’m just waiting for the 22nd June, when I start work at a local company, a week’s holiday for a french family wedding, and then exam results in August, and hopefully University in October, although it could be September if I am unlucky and miss my firm choice, although if I do end
up in clearing I have no idea when I’ll start.

Now exams are over, I can start to concentrate more fully on various projects that I’ve been saving up throughout the last few months.

  • Helpmebot version 6 is a major project that I’m hoping to continue and finish off over summer, it’s a complete re-write moving towards an object-oriented approach to the bot. This will make it much easier to add database caching, which should reduce it’s load on the database servers, and ultimately, decrease execution time.
  • ACC: OverlordQ has nicely proposed a complete re-write of the tool, which is a good idea given the code is now a stinking pile of crap, and a nightmare to work with. I was planning on a staged re-write of the tool, converting to OO, but OQ seems to think that it would be better to do a complete re-write, and I’m inclined to agree.
  • A. S. S.: Slug Wars: This is a project that will be hopefully started over Summer, and also hopefully nearing completion when we go to Uni. More info will come on http://albinoslugstudios.co.uk/ in the near future hopefully :D

There are several other projects that I have forgotten, but those are the main ones.

Also distracting me over summer will be Project Euler, and various other small programs that I’m hoping to write.

One thing that has got my attention is a permutation calculation program, which can be done nicely using recursion. I’m hoping to implement some version of these ( http://www.bearcave.com/random_hacks/permute.html ) over summer at some point, which will be useful at calculating all the different possibilities for “wimt”, for instance: imtw, imwt, itmw, itwm, iwmt, iwtm, mitw, miwt, mtiw, mtwi, mwit, mwti, timw, tiwm, tmwi, twim, twmi,
wimt, witm, wmit, wmti, wtim, and wtmi. While it’s possible to work that one out manually, I want to get the results for something like “farosdaughter”, “stwalkerster”, and “cremepuff222”. For “stwalkerster”, there will be 479001600 permutations, so I’m expecting to produce a 5.7G file all the permutations. Following on from that, I want to sort them into alphabetical order.

Also, I am looking to implement a simple linked list in C++, with the possibility of expanding it to form a double-linked list, and possibly expanding to become a circular linked list. Using a linked list, I can easily sort all those permutations into order on insertion.

Alternatively, a better approach might be to use a binary tree. This will vastly improve seek time, as it will only take a maximum of 29 iterations on a perfectly balanced binary tree to search for a specific item, plus it makes implementation of a binary search much more easy.