Ooooh you're right! Your algorithm is surely fairer than mine! I might consider it, although I hate trees with a passion and I might use a bidimensional array or something like that instead, although I do know they're usually a less efficient solution compared to the damned trees. xD I'll let you know when I'm done, although it might take a while because I'm quite busy with uni (exams, lessons, projects, oh dear, it's going to be quite a semester)!
no subject
I'll let you know when I'm done, although it might take a while because I'm quite busy with uni (exams, lessons, projects, oh dear, it's going to be quite a semester)!