BogoSort is a highly ineffective algorithm notable only for its comedic value....

Insertion Sort is a blissfully simple algorithm that is painfully inefficient for large arrays. It operates in place and with relative efficiency compared to several more complicated (read: better)...

This sorting algorithm performs multiple passes over a list, comparing consecutive elements. If the two elements are out of order, they are swapped. This continues until a pass shows all elements...

Mergesort is a simple divide and conquer sorting algorithm. It works by recursively splitting an unsorted array into two sub-arrays then merging the sorted results....

Quicksort is a fast, recursive, divide and conquer algorithm developed by Charles Antony Richard Hoare. It is believed to be the fastest sorting algorithm, in practice [Weiss1999]....