isnertion sorting techniques in Data structures and Algorithms

1.  Mohammad Abdur Rahman
 Shah Zaib
 Sania Shakir
MARS

2. MARS

3. • Unsorted Data
MARS
5 10 3 197
0 1 2 3 4

4.  Compare the elements
 7 is greater then 5
 Then SWAP
MARS
5 10 3 197
0 1 2 3 4

5.  Compare the first three elements
 7 is less then 10
 Then NO SWAPing
MARS
0 1 2 3 4
7 10 3 195

6.  Compare the first four elements
 3 is less then 5
 Insert it into the proper position
among the first four elements.
MARS
0 1 2 3 4
7 10 3 195

7.  Compare the first five elements
 19 is greater then all 5 elements.
 Insert it into the proper position
among the first four elements.
MARS
5 7 10 193

8. 5 10 3 197
0 1 2 3 4
0 1 2 3 4
0 1 2 3 4
0 1 2 3 4
7 10 3 195
7 10 3 195
5 7 10 193
0 1 2 3 4
5 7 10 193
MARS

9. MARS

10. MARS