Programmer Think

Definition of sorting The process of arranging a given number of data elements into an ordered sequence according to the specified data items is called sorting. Inner sorting The process of reading the data to be sorted into memory at one time and completing the sorting is called internal sorting. External sorting The process of reading the dat ...

JS implementation of various sorting There are many kinds of sorting in data structure algorithms, common and uncommon, including at least ten kinds. According to their characteristics, they can be roughly divided into two types: comparison sort and non comparison sort. Comparison sort: the relative order between elements is determined by com ...

subject Enter the integer array arr to find the minimum number of k. For example, if you enter 8 numbers: 4, 5, 1, 6, 2, 7, 3 and 8, the smallest 4 numbers are 1, 2, 3 and 4. Example 1: Input: arr = [3,2,1], k = 2 output: [1,2] or [2,1] example 2: Input: arr = [0,1,2,1], k = 1, output: [0] Restrictions: 0 <= k <= arr.length &l ...

concept Sorting: a series of records arranged in ascending or descending order according to the size of one or some keywords. Generally, sorting refers to sorting in place. What is sort stability Sorting stability: for two equal data, if the sorting algorithm can ensure that its relative position does not change after sorting, then the a ...

Catalogue preface Quick sort Basic use Parameter interpretation Simulation Implementation preface First of all, I wish you a happy New Year 🎉 🎉 🎉! hello ✨， Hello, everyone. This is the original 💖 💛💙， With more and more articles, there may be many partners who can't find the articles they want to read, so I came out. ...

Guide to series of articles Guide to series of articles preface After we are familiar with the idea and implementation principle of quick sort, we can bring a lot of inspiration and inspiration in our actual development. With the idea of double pointer walking of quick sort, we can also solve many kinds of quick sort problems. Now let's use ...

1, Fundamentals of sorting algorithm 1. Algorithm classification Common sorting algorithms can be divided into two categories: Comparison sort: the relative order between elements is determined by comparison. Because its time complexity cannot exceed O(nlogn), it is also called nonlinear time comparison sort. Non comparison sort: the re ...

catalogue 6. Heap sorting 7. Quick sort 7.1 fast exhaust 1.0 7.2 fast exhaust 2.0 7.3 fast exhaust 3.0 7.4 summary 6. Heap sorting Learning heap sorting has to introduce the types of binary trees. Binary trees are divided into complete binary trees, balanced binary trees, ordered binary trees, full binary trees and perfect binary trees ...

sort Sorting is an algorithm that arranges data in a certain order. The following are introduced one by one. 1, Bubble sorting Bubble sorting is to compare the elements between lists in pairs, and the large exchange position is to the right. In the first pairwise comparison, the largest element must be placed on the far right, so the second ...

Catalog 1. Quick Sort Version 1.1: Version 1.2 2 2: Version 1.3 3 3: Version 1.4 4 4: Version 1.5 5 5: 2 Derived problems of merge sort and quick sort 2.1 Inverse Order Pair Problem 2.2 Take the nth largest element in the array 1. Quick Sort Version 1.1: Intermediate process: Finally: In this case, you only need to exchange t ...