The document discusses the quick sort algorithm through examples. It explains that quick sort works by picking a pivot element and partitioning the array around it such that elements less than the pivot come before and elements greater than or equal to the pivot come after. It then recursively applies this process on the subarrays until the entire array is sorted. The document provides a step-by-step example of applying quick sort to an array of numbers to demonstrate how it works.

1. DATA STRUCTURE
Dr.M.UMADEVI
ASSISTANT PROFESSOR
DEPARTMENT OF CS
SACWC, CUMBUM

2. Quick Sort

3. What is Quick Sort ??
 Quick Sort is the most widely used of all the other sorting algorithms
because they are faster and consume less memory.
It is superior to (bubble sort) and (insertion sort) and (selection sort)
speed and distinct from (merge sort) speed and available memory.

4. What is Quick Sort ??
Division here is to divide the list into two smaller and larger
where there is a so-called (pivot) and it is determined smaller
or larger is not required to be a number of elements in both
sections of equal or arranged in ascending or descending
order.
 This algorithm is the order of the array at a rate of ( n*log n), where n is
the step number of the elements of the array ..

5. What is Quick Sort ??
p
numbers less
than p
numbers greater than or
equal to p
p

6. Quick Sort
41 62 3513 28579684 79

7. Quick Sort
41 62 3513 28579684 79
Pivot = 41

8. Quick Sort
41 62 3513 28579684 79
Pivot = 41
i

9. Quick Sort
41 62 3513 28579684 79
Pivot = 41
i j

10. Quick Sort
41 62 3513 28579684 79
Pivot = 41
i j
41>79 ??

11. Quick Sort
41 62 3513 28579684 79
Pivot = 41
i j
41>79 ??
False

12. Quick Sort
41 62 3513 28579684
Pivot = 41
i j
j--
79

13. Quick Sort
41 62 3513 28579684
Pivot = 41
i j
79
41>28 ??

14. Quick Sort
41 62 3513 28579684
Pivot = 41
i j
79
41>28 ??
True

15. Quick Sort
41 62 3513 28579684
Pivot = 41
i j
79

16. Quick Sort
4162 351328 579684
Pivot = 41
i j
79
Pivot = j

17. Quick Sort
4162 351328 579684
Pivot = 41
i j
79
i++

18. Quick Sort
4162 351328 579684
Pivot = 41
i j
79
62>41 ??

19. Quick Sort
4162 351328 579684
Pivot = 41
i j
79
62>41 ??
True

20. Quick Sort
4162 351328 579684
Pivot = 41
i j
79

21. Quick Sort
41 351328 579684
Pivot = 41
i j
79
Pivot = i
62

22. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
j--

23. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>57 ??

24. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>57 ??
False

25. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
j--

26. Quick Sort
41 351328 579684
Pivot = 41
i j
7962

27. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>96 ??

28. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>96 ??
False

29. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
j--

30. Quick Sort
41 351328 579684
Pivot = 41
i j
7962

31. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>35 ??

32. Quick Sort
41 351328 579684
Pivot = 41
i j
7962
41>35 ??
True

33. Quick Sort
41 351328 579684
Pivot = 41
i j
7962

34. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
Pivot = j

35. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
i++

36. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
13>41 ??

37. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
13>41 ??
False

38. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
i++

39. Quick Sort
35 1328 579684
Pivot = 41
i j
796241
84>41 ??

40. Quick Sort
35 1328 579684
Pivot = 41
i j
796241

41. Quick Sort
35 1328 5796
Pivot = 41
i j
796241 84

42. Quick Sort
35 1328 5796
Pivot = 41
i j
796241 84
j++

43. Quick Sort
35 1328 5796
Pivot = 41
i j
796241 84
i=j

44. Quick Sort
35 1328 5796
Pivot = 41
796241 84
a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8]

45. Quick Sort
35 1328 5796
Pivot = 41
796241 84
a[0] a[1] a[2]

46. Quick Sort
35 1328 5796
Pivot = 41
796241 84
a[0] a[1] a[2] a[0] a[1] a[2] a[3] a[4]

47. Quick Sort
35 1328 5796 796241 84
a[0] a[1] a[2] a[0] a[0] a[1] a[2] a[3] a[4]
numbers less than p numbers greater than or equal to p

48. Quick Sort
35 1328
5796 796241 84
Now we sort numbers less than p

49. Quick Sort
35 1328
5796 796241 84
Pivot = 28

50. Quick Sort
5796 796241 84
Pivot = 28
i
35 1328

51. Quick Sort
35 1328
5796 796241 84Pivot = 28
i j

52. Quick Sort
35 1328
5796 796241 84Pivot = 28
i j
28>13 ??

53. Quick Sort
35 1328
5796 796241 84Pivot = 28
i j
28>13 ??
True

54. Quick Sort
35 1328
5796 796241 84Pivot = 28
i j

55. Quick Sort
3513
5796 796241 84Pivot = 28
i j
28
Pivot = j

56. Quick Sort
3513
5796 796241 84Pivot = 28
i j
28
i++

57. Quick Sort
3513
5796 796241 84Pivot = 28
i j
28
35>28 ??
True

58. Quick Sort
3513
5796 796241 84Pivot = 28
i j
28

59. Quick Sort
13
5796 796241 84Pivot = 28
i j
28 35

60. Quick Sort
13
5796 796241 84
28 35
a[0] a[1] a[2]

61. Quick Sort
13
5796 7962
41
84
28 35
Now we sort numbers greater than or equal to p

62. Quick Sort
13
5796 7962
41
84
28 35
a[0] a[1] a[2] a[3] a[4]

63. Quick Sort
13
5796 7962
41
84
28 35
Pivot = 84

64. Quick Sort
13
5796 7962
41
84
28 35
i=84 j=79
i j

65. Quick Sort
13
5796 7962
41
84
28 35
i j
84>79 ??

66. Quick Sort
13
5796 7962
41
84
28 35
i j
84>79 ??
True

67. Quick Sort
13
5796 7962
41
84
28 35
i j

68. Quick Sort
13
579679 62
41
84
28 35
i j

69. Quick Sort
13
579679 62
41
84
28 35
i j

70. Quick Sort
13
579679 62
41
84
28 35
i j
i=96

71. Quick Sort
13
579679 62
41
84
28 35
i j
96>84 ??

72. Quick Sort
13
579679 62
41
84
28 35
i j
96>84 ??
True

73. Quick Sort
13
579679 62
41
84
28 35
i j

74. Quick Sort
13
5779 62
41
84
28 35
i j
96

75. Quick Sort
13
5779 62
41
84
28 35
i j
96
j--

76. Quick Sort
13
5779 62
41
84
28 35
i j
96
84>62 ??

77. Quick Sort
13
5779 62
41
84
28 35
i j
96
84>62 ??
True

78. Quick Sort
13
5779 62
41
84
28 35
i j
96

79. Quick Sort
13
5779 62
4128 35
i j
9684

80. Quick Sort
13
5779 62
4128 35
i j
9684
i++

81. Quick Sort
13
5779 62
4128 35
i j
9684
57>84 ??

82. Quick Sort
13
5779 62
4128 35
i j
9684
57>84 ??
False

83. Quick Sort
13
5779 62
4128 35
i j
9684

84. Quick Sort
13
5779 62
4128 35
i j
9684
i++

85. Quick Sort
13
5779 62
4128 35
i j
9684
i=j

86. Quick Sort
13
5779 62
4128 35
i j
9684
a[0] a[1] a[2] a[0] a[0]

87. Quick Sort
13
5779 62
4128 35
9684
a[0] a[1] a[2] a[0] a[0]
numbers less than p
numbers greater
than or equal to p

88. Quick Sort
13
5779 62
4128 35
96
84

89. Quick Sort
13 5779 624128 35
96
84
Now we sort numbers greater than or equal to p

90. Quick Sort
13 5779 624128 35
96
84
i j
i=j=96

91. Quick Sort
13
5779 62
4128 35 9684
Now we sort numbers less than p

92. Quick Sort
13
5779 62
4128 35 9684
i j
Pivot = 79

93. Quick Sort
13
5779 62
4128 35 9684
i j
79>57 ??

94. Quick Sort
13
5779 62
4128 35 9684
i j
79>57 ??
True

95. Quick Sort
13
5779 62
4128 35 9684
i j

96. Quick Sort
13
62
4128 35 9684
i j
7957

97. Quick Sort
13
62
4128 35 9684
i j
7957
i++

98. Quick Sort
13
62
4128 35 9684
i j
7957
62>79 ??

99. Quick Sort
13
62
4128 35 9684
i j
7957
62>79 ??
False

100. Quick Sort
13
62
4128 35 9684
i j
7957
i++

101. Quick Sort
13
62
4128 35 9684
i j
7957
i=j

102. Quick Sort
13
62
4128 35 9684
7957
a[0] a[1] a[0]

103. Quick Sort
13
62
4128 35 9684
7957
a[0] a[1] a[0]
numbers less than p

104. Quick Sort
13
62
4128 35 968479
57

105. Quick Sort
13
62
4128 35 968479
57
Now we sort numbers less than p

106. Quick Sort
13
62
4128 35 968479
57
i=57 j=62
Pivot = 57
i j

107. Quick Sort
13
62
4128 35 968479
57
i j
57>62 ??
False

108. Quick Sort
13
62
4128 35 968479
57
i j
j--

109. Quick Sort
13
62
4128 35 968479
57
i j
i=j

110. Quick Sort
13
62
4128 35 968479
57
numbers greater
than or equal to p

111. Quick Sort
13
62
4128 35 96847957
Now we sort numbers greater than or equal to p

112. Quick Sort
13
62
4128 35 96847957
i=62 j=62
Pivot = 62
i j

113. Quick Sort
13
62
4128 35 96847957
i j
i=j

114. Quick Sort
13
62
4128 35 96847957

115. Quick Sort
13 624128 35 96847957
a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8]