About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 78. Chapters: Sorting algorithm, Merge sort, Radix sort, Insertion sort, Heapsort, Selection sort, Shell sort, Bucket sort, Pigeonhole sort, Merge algorithm, Counting sort, Bogosort, Smoothsort, Comb sort, Cocktail sort, Quicksort, Cartesian tree, Bubble sort, Proxmap sort, Topological sorting, Spreadsort, Pancake sorting, Schwartzian transform, Sorting network, Comparison sort, UnShuffle sort, External sorting, Inversion, Flashsort, Polyphase merge sort, Adaptive sort, Timsort, Gnome sort, Elevator algorithm, Bead sort, Bitonic sorter, Strand sort, Cycle sort, Introsort, Poolsort, Tree sort, Spaghetti sort, Dutch national flag problem, Batcher odd-even mergesort, Library sort, Stooge sort, Tournament sort, Burstsort, JSort, Odd-even sort, Internal sort, Quantum sort, Pairwise sorting network, American flag sort, Samplesort, Ordicate, Median cut, Adaptive heap sort, Luckysort, J sort. Excerpt: In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output. More formally, the output must satisfy two conditions: Since the dawn of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently despite its simple, familiar statement. For example, bubble sort was analyzed as early as 1956. Although many consider it a solved problem, useful new sorting algorithms are still being invented (for example, library sort was first published in 2004). Sorting algorithms are prevalent in introductory computer science classes, where t...
