sorting algorithm Tree sort Tree sort is an online sorting algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order.

sorting algorithm Shell Sort Shellsort (also known as Shell sort or Shell's method) is an in-place comparison based sorting algorithm. Shell Sort improves its time complexity by taking the advantage of the fact that using Insertion Sort on a partially sorted array results in less number of moves.

sorting algorithm Binary Insertion Sort Binary search is used to reduce the number of comparisons in Insertion sort. This modification is known as Binary Insertion Sort. Binary Insertion Sort use binary search to find the proper location to insert the selected item at each iteration.

sorting algorithm Insertion Sort Insertion sort is an online stable in-place sorting algorithm that builds the final sorted list one item at a time. It works on the principle of moving a element to its correct position.

sorting algorithm Merge Sort Algorithm Complexity Implementations Applications Discussions The merge sort is a comparison-based sorting algorithm based on divide and conquer strategy. It has a usual performance of Θ(nlogn). This algorithm works by dividing the

sorting algorithm Quick Sort Algorithm Complexity Implementations Optimizations Applications Discussions Quicksort algorithm is a comparison sort algorithm based on Divide and Conquer strategy. It has an average performance of Θ(n*log(n)) and is considered as

sorting algorithm Intelligent Design Sort or Quantum BogoSort Quantum Bogo Sort a quantum sorting algorithm which can sort any list in Θ(1), using the "many worlds" interpretation of quantum mechanics. The Many-Worlds Interpretation (MWI) of quantum mechanics holds

sorting algorithm Bogo sort Algorithm Complexity Implementations Discussions BogoSort also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective algorithm based on generate and test paradigm. The algorithm successively

sorting algorithm Bead Sort Algorithm Complexity Implementations Discussions Bead sort, also called gravity sort, is a natural sorting algorithm. Both digital and analog hardware implementations of bead sort can achieve a sorting time of O(n); however,

sorting algorithm Bubble Sort Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order. Implementations in Java, C++, C, Go, Swift, JavaScript and many more.

sorting algorithm Selection Sort Algorithm Complexity Implementations Applications Discussions The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The good thing