Implementing basic sorting algorithms.
-
Radix Sort - A non-comparative integer sorting algorithm, arranges data by examining individual digits.
-
Quicksort - A comparison-based sorting algorithm following the divide-and-conquer approach.
-
Heapsort - A comparison-based algorithm, uses a binary heap data structure to build a partially ordered tree.
-
Tim Sort - A hybrid sorting algorithm blending merge sort and insertion sort.
-
Bogosort - A humorously inefficient sorting algorithm generates random permutations of the input array and checks if they are sorted.