Tornamic/Pawn.Sort

Sorting algorithms for Pawn

Pawn.Sort

Sorting algorithms for Pawn

Author: Tornamic (Kirill Tymoshchenko)

Discord: https://pastebin.com/raw/LMBNfFHE
Github: https://github.com/Tornamic
pawn.wiki https://pawn.wiki/i.php?/user/54232-tornamic/

Installation

#include <Pawn.Sort>

Example

main()
{
    new array[100];
    Array::FillRandomValues(array);
    print("Bubble sort:");
    Sort::Bubble(array);
    Array::Print(array);
}

Quadratic Sort Functions

native Sort::Bubble(array[], const len = sizeof array);
native Sort::Selection(array[], const len = sizeof array);
native Sort::Insertion(array[], const len = sizeof array);
native Sort::Gnome(array[], const len = sizeof array);
native Sort::Shaker(array[], len = sizeof array);
native Sort::OddEven(array[], const len = sizeof array);

Logarithmic Sort Functions

native Sort::Quick(array[], left, right);
native Sort::Heap(array[], const len = sizeof array); 
native Sort::Shell(array[], const len = sizeof array); 

Weird Sort Functions

native Sort::Bogo(array[], const len = sizeof array);

Misc Functions

native Var::Swap(&value1, &value2);
native Array::FillRandomValues(array[], const len = sizeof array, randmin = -10000, randmax = 10000);
native Array::Print(array[], const len = sizeof array);
native Array::Shuffle(array[], const len = sizeof array);
native Array::IsSorted(const array[], const len = sizeof array);

Time to sort an array of 100 cells (less is better)

Quick Sort:         0.057900 ms
Shell Sort:         0.098600 ms
Heap Sort:          0.145300 ms
Insertion Sort:     0.212200 ms
Selection Sort:     0.273199 ms
Shaker Sort:        0.442599 ms
Gnome Sort:         0.470999 ms
OddEven Sort:       0.514299 ms
Bubble Sort:        0.783600 ms
Bogo Sort:          Infinity