Sort Array in Wave Format

This sorts an array in an ascending order through iterating from first to second last element. By sorting the array in ascending order first and then swapping adjacent elements, it is ensured that each element is greater than or equal to its adjacent elements. This creates the wave-like pattern.

Count Sort

Counting Sort is an efficient linear-time sorting algorithm that works well when the range of input values is small. It counts the occurrences of each distinct element in the input array and uses this information to determine the position of each element in the sorted output.

Radix Sort

Radix Sort is a non-comparative sorting algorithm that sorts elements by grouping them based on individual digits or bits. It starts by sorting the least significant digit and progressively moves towards the most significant digit, resulting in a sorted array.

Shell Sort

Shell Sort, also known as Shell's method, is an in-place comparison-based sorting algorithm that is an extension of the Insertion Sort algorithm. It improves the efficiency of Insertion Sort by allowing elements to be moved in larger steps rather than one position at a time.

Comb Sort

Comb Sort is a comparison-based sorting algorithm that improves upon the Bubble Sort algorithm by eliminating small values at the end of the list quickly. It works by comparing elements that are distant from each other and gradually reducing the gap between them until the entire array is sorted.

Pigeonhole Sort

Pigeonhole Sort is a sorting algorithm that is used when the range of possible input values is relatively small and known beforehand. It works by distributing the elements into pigeonholes (or buckets) based on their values and then retrieving the elements in sorted order.

Cycle Sort

Cycle Sort is an in-place sorting algorithm that minimizes the number of memory writes by moving items to their correct positions with the help of cyclic rotations. It is particularly useful when minimizing the number of writes is important, such as in cases where writing to memory is costly or limited.