Insertion Sort CH Gowri Kumar [email_address]
Insertion Sort <ul><li>Consists of N-1 passes </li></ul><ul><li>For pass P = 1 through N-1, insertion sort ensures that th...
void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 ...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for( P = 1 ;P<N; P++) { Tmp = A[...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1 ;P<N ; P++) { Tmp = A[...
34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[...
8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[...
8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N;  P++ ) { Tmp = A[...
8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[...
8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]...
The End
Upcoming SlideShare
Loading in...5
×

Insertion Sort

1,113

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,113
On Slideshare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
80
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Transcript of "Insertion Sort"

  1. 1. Insertion Sort CH Gowri Kumar [email_address]
  2. 2. Insertion Sort <ul><li>Consists of N-1 passes </li></ul><ul><li>For pass P = 1 through N-1, insertion sort ensures that the elements in positions 0 through P are in the sorted order </li></ul><ul><li>In pass P, the element in the position P is moved left until its correct place is found among the first P + 1 elements. </li></ul><ul><li>Complexity - O(n 2 ) </li></ul>
  3. 3. void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  4. 4. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  5. 5. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  6. 6. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  7. 7. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  8. 8. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for( P = 1 ;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  9. 9. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1 ;P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  10. 10. 34 8 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  11. 11. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  12. 12. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for ( j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  13. 13. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  14. 14. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  15. 15. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  16. 16. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  17. 17. 34 64 51 32 21 8 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  18. 18. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  19. 19. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  20. 20. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  21. 21. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  22. 22. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  23. 23. 8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  24. 24. 8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for ( j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  25. 25. 8 34 51 32 21 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  26. 26. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  27. 27. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  28. 28. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  29. 29. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  30. 30. 8 34 64 51 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  31. 31. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  32. 32. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for ( j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  33. 33. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  34. 34. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  35. 35. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  36. 36. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  37. 37. 8 34 64 32 21 51 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  38. 38. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  39. 39. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  40. 40. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  41. 41. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  42. 42. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  43. 43. 8 34 51 64 32 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  44. 44. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  45. 45. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for ( j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  46. 46. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  47. 47. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  48. 48. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  49. 49. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  50. 50. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  51. 51. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  52. 52. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  53. 53. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  54. 54. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  55. 55. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  56. 56. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  57. 57. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  58. 58. 8 34 51 64 21 32 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  59. 59. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  60. 60. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  61. 61. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  62. 62. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  63. 63. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  64. 64. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  65. 65. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  66. 66. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for ( j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  67. 67. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  68. 68. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  69. 69. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  70. 70. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  71. 71. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  72. 72. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  73. 73. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  74. 74. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  75. 75. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  76. 76. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  77. 77. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  78. 78. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  79. 79. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  80. 80. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  81. 81. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j-- ) A[ j] = A[j-1]; A[j] = Tmp; } }
  82. 82. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P; j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  83. 83. 8 32 34 51 64 21 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  84. 84. 8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp ; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  85. 85. 8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  86. 86. 8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++ ) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  87. 87. 8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1; P<N ; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  88. 88. 8 21 32 34 51 64 void InsertionSort(ElementType A[ ], int N) { int j, P; ElementType Tmp; for(P = 1;P<N; P++) { Tmp = A[P]; for (j = P;j>0 && A[j-1] > Tmp; j--) A[ j] = A[j-1]; A[j] = Tmp; } }
  89. 89. The End
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×