[RedFusion]

Quote:

Originally Posted by EnzoMetlc eciN, but, can you give me some speed test? (I cant do it, because my PC dont work).

Sure, i'll provide speed tests on the main post in a short while.

Quote:

Originally Posted by ****** This looks like BubbleSort, which is a VERY slow sorting algorithm, and is recursive, which PAWN is not good at. Have you tried this on an array of, say 1000 unsorted elements? I'm pretty sure the server will run out of memory, after a long time. I suggest you read up on the algorithmic complexity of bubblesort vs quicksort.

Been re-writing it a few times and it should not resemble bubble-sort as much now.

And yes, i noticed it didn't work on arrays of bigger sizes (1000~ +), unfortunately....

I've been reading briefly about sorting algorithms but i haven't wrapped my head around what makes quicksort so much faster (yet).

Quote:

Originally Posted by codectile There is already a sorting include for pawn in the CRF, https://github.com/codectile/CRF-Lib...er/c_arlib.inc

CRF? Never heard of it before.