Insert sort (top): Insert sort directly, insert sort directly

Insert sort (top): Insert sort directly, insert sort directly

1. Thoughts

Direct sorting can be divided into two parts: ordered and unordered.

From this figure, we can see the idea of directly inserting sorting.

Compare the first part of the unordered part with the ordered part.

Compare the data from the back of the ordered part, and then constantly move the data position of the ordered part.

Static void InsertSort (List <int> list) {for (int I = 1; I <list. count; I ++) {int temp = list [I]; int j = I; while (j> = 1 & temp <list [j-1]) {list [j] = list [j-1]; j --;} list [j] = temp ;}}

 

2. Complexity

In the best case of direct insertion sorting, the time complexity is O (n), and in the worst case, the complexity is O (n2 );

For proof, see:

Insert sorting and Complexity Analysis

 

3. Direct insertion and sorting vs quick sorting