Sorting algorithms: Learn the fundamentals of sorting algorithms

Learn the fundamentals of sorting algorithms , such as insertion sort, merge sort and bucket sort, with Python, Java and C++ code examples. Compare the time and space complexity of each algorithm and see how they work. There are many different sorting algorithms , each has its own advantages and limitations. Sorting is commonly used as the introductory problem in various Computer Science classes to showcase a range of algorithmic ideas. Sorting demos. Below are some interesting sorting demos. Sorting Algorithm Animations by David Martin. Audibilization and Visualization of Sorting Algorithms by Timo Bingmann. The Sound of Quicksort. Robot visualizations of quicksort and mergesort. Sorting visualizations by Carlo Zapponi, using inversion count as a measure of progress. A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order.