Insertion Sort Algorithms

Insertion sort takes an element and checks the left element if greater,if left element is greater checks second left until left element is smaller then creates a gap by copying the first element to temp and moving the first left element to it's location then moves the second element to first left elements position does this until

 

3 7 4 9 5 2 6 1

3 7 4 9 5 2 6 1

3 7 4 9 5 2 6 1

3 4 7 9 5 2 6 1

3 4 7 9 5 2 6 1

3 4 5 7 9 2 6 1

2 3 4 5 7 9 6 1

2 3 4 5 6 7 9 1

1 2 3 4 5 6 7 9

 

Shell sort is like comb sort it attacks the problem by moving the turtles faster by introducing gaps

The first pass 5-sorting performs insertion sort on seperate sub arrays 1 6 11 16 .. 2 7 12 17 vs

 

Tree sort first builds a binary search tree(oredered or sorted binary tree) </DIV></DIV></DIV