[Dabombber]

Quote:

Originally Posted by TMasters.ProRP we tested sortings in our school with 100000 numbers, for seledtion sort it too 40000ms (40sec) and for merge and quick arround 34ms, so you say quick used 1000+ms for 10k nmbers, i cant belive it.

That would have been in c or something, pawn is slower. If only I had posted the code or something so you could test it yourself...