1. CH Gowri Kumar gkumar007@gmail.com
Insertion Sort
CH Gowri Kumar

2. Insertion Sort Consists of N-1 passes
For pass P = 1 through N-1, insertion sort ensures that the elements in positions 0 through P are in the sorted order
In pass P, the element in the position P is moved left until its correct place is found among the first P + 1 elements.
Complexity - O(n2)
April 16, 2019

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; }
April 16, 2019

4. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

5. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

6. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

7. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

8. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

9. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

10. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

11. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

12. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

13. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

14. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

15. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

16. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

17. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

18. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

19. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

20. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

21. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

22. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

23. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

24. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

25. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

26. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

27. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

28. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

29. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

30. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

31. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

32. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

33. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

34. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

35. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

36. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

37. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

38. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

39. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

40. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

41. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

42. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

43. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

44. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

45. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

46. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

47. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

48. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

49. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

50. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

51. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

52. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

53. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

54. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

55. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

56. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

57. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

58. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

59. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

60. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

61. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

62. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

63. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

64. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

65. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

66. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

67. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

68. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

69. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

70. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

71. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

72. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

73. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

74. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

75. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

76. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

77. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

78. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

79. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

80. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

81. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

82. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

83. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

84. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

85. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

86. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

87. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

88. void InsertionSort(ElementType A[ ], int N) { int j, 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];
for (j = P;j>0 && A[j-1] > Tmp; j--)
A[ j] = A[j-1];
A[j] = Tmp; }
April 16, 2019

89. The End
April 16, 2019