Insert Sort algorithm

Understanding shorthand: Symbolic notation: Solitaire numbered 0--n-1,

Thought: From the card of the number 1--n-1 in order to select the grade from the back to the front insert

First: The card number 0, at this time numbered 0 ordered;

Second time: Take the card number 1, compared with the number 0, the small plug in front, at this time the number 0,1 orderly;

Third: Take the card number 2, compared with the number 1, the small plug in front, and the number 0 than the small plug in front, the number of the Thorn hand 0,1,2 ordered;

。。。。

Programming: Double Cycle

Outer: for i= 1:n-1

Inner layer: j=i; For j=i-1:0

Condition: Small is inserted before

Insert Sort algorithm