(a) The insertion class and the exchange class sort made a more detailed summary, for direct insertion, Hill sort, bubble sort, quick sort requirements to master the comprehensive summary of this article (two) mainly introduces the selection of simple class sort, tree and heap sort, merge sort,

Foreword reading "learning JavaScript data structure and algorithm (3rd edition)" have a feeling that I hope every time learning algorithm can output a blog, income column, check their own learning situation ~ article is wrong welcome all big god correction, don't spray, if you want to spray, trouble light, thank god

Finally, we come to the last two algorithms, the linear time complexity algorithm of the non-comparison class, counting sort and radix sort. On an article also mentioned that it is not difficult to understand these sorting algorithms, time and space complexity analysis is also very simple, but very demanding to to sort the data requirement, mentioned in the previous bucket sort is applicable to the sorting of the external, the so-called external sorting is data stored in an external disk, the data quantity is big...

Bubbling sort compares all two adjacent items and swaps them if the first is larger than the second. Items move up to the correct order, like bubbles rising to the surface, hence the name bubble sort

Foreword reading "learning JavaScript data structure and algorithm (3rd edition)" have a feeling that I hope every time learning algorithm can output a blog, income column, check their own learning situation ~ article is wrong welcome all big god correction, don't spray, if you want to spray, trouble light, thank god

Bubble sequencing was studied in 1956. But the sorting speed is relatively slow, bubble sort time complexity is O(n^2), however, in the following a long time, although people invent a variety of sorting algorithms (such as the previous selection sort and insertion sort), but the time complexity is 0(n^2), time complexity seems to be unable to exceed 0(n^2). At this point, the computer world is full of "sorting algorithms don't...

Bucket Sort allocates the data to be sorted to a limited number of buckets and sorts the data in each Bucket. Bucket Sort is a linear time sorting algorithm. Each Bucket represents a range that can hold one or more elements. The first

Foreword reading "learning JavaScript data structure and algorithm (3rd edition)" have a feeling that I hope every time learning algorithm can output a blog, income column, check their own learning situation ~ article is wrong welcome all big god correction, don't spray, if you want to spray, trouble light, thank god

The algorithm that sorts the data sequentially from the left end of the sequence is called insertion sort. In the unsorted region, take the leftmost number 3 and compare it to the number in the sorted region. If the left digit is larger, the two digits are swapped and the operation is repeated until either the returned digit is smaller than the removed digit, or the removed digit has been moved to the far left of the entire sequence. 5>4, so swap these two...

Foreword reading "learning JavaScript data structure and algorithm (3rd edition)" have a feeling that I hope every time learning algorithm can output a blog, income column, check their own learning situation ~ article is wrong welcome all big god correction, don't spray, if you want to spray, trouble light, thank god