Implementation code for Python insertion sorting algorithm

1. Algorithm:
There is a set of keywords {k 1, K 2, ..., K n}; The ordering begins with the thought that K 1 is an ordered sequence; let K 2 insert an ordered sequence with a table length of 1, making it an ordered sequence with a table length of 2, and then let K 3 insert an ordered sequence with a table length of 2, which becomes a table 3 ordered sequence, and so on, finally let K n insert the above table length as the ordered sequence of n-1, a table with an ordered sequence of N.

2.python inserting sort codes

Copy the Code code as follows:

def insertion_sort (List2):
For I in range (1, Len (LIST2)):
Save = List2[i]
j = I
While J > 0 and List2[j-1] > Save:
LIST2[J] = list2[j-1]
J-= 1
LIST2[J] = Save

Results: [2, 3, 4, 21, 33, 44, 45, 67]

3. Complexity of Time: O (n*n)

