The document provides an overview of the quick sort algorithm through diagrams and explanations. It begins by introducing quick sort and stating that it is one of the fastest sorting algorithms because it runs in O(n log n) time and uses less memory than other algorithms like merge sort. It then provides step-by-step examples to demonstrate how quick sort works by picking a pivot element, partitioning the array around the pivot, and recursively sorting the subarrays. The summary concludes by restating that quick sort is an efficient sorting algorithm due to its speed and memory usage.

1. Queck Sort
Jehat Hassan
Serbast Hamid
Serhldan Salih
Walid Abduljabar

2. What is Quick Sort ??
Ranking manner 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 in spite of the latter outweigh the three counterparts,
but he also quickly consumes more memory.

3. 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, but what is important in
the partitioning phase is to make the smallest of the axis
division in the department and the largest in the last
section.

4. What is Quick Sort ??
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 ..
Meaning:
If we have a array of the element 128, this will Khurazem
Petrtaha in step 896 ..
And this number is very appropriate when compared to
other ranking algorithms
For example, in Bubble sort algorithm will need to step 16384
in any way ..

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 ??
Fals

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 ??
Fals

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 ??
Fals

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 ??
Fals

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[0]
a[0]

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 ??
Fals
e

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 ??
Fals
e

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=84 j=79
Pivot = 84
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=79 j=79
Pivot = 79
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]

116. Do you
understand
Quick Sort ?

117. If you do not understand.........
See this video.....
And do not laugh ;)

119. ‫؟‬ ‫السريع‬ ‫الفرز‬ ‫أسلوب‬ ‫لماذا‬
‫األسرع‬ ‫ألنها‬ ‫األخرى‬ ‫الفرز‬ ‫خوارزميات‬ ‫جميع‬ ‫من‬ ‫استخداما‬ ‫األكثر‬ ‫يعتبر‬ ‫السريع‬ ‫الفرز‬ ‫بأسلوب‬ ‫الترتيب‬‫وأقل‬
‫للذاكرة‬ ‫استهالكا‬.
‫الفقاعة‬ ‫بأسلوب‬ ‫الفرز‬ ‫على‬ ‫تتفوق‬ ‫هي‬ ‫إذ‬(bubble sort)‫اإلدخال‬ ‫بأسلوب‬ ‫الفرز‬ ‫و‬(insertion sort)‫بأسلوب‬ ‫الفرز‬ ‫و‬
‫االختيار‬(selection sort )‫الدمج‬ ‫بأسلوب‬ ‫الفرز‬ ‫عن‬ ‫وتتميز‬ ‫بالسرعة‬(merge sort)‫بالرغم‬ ‫للذاكرة‬ ‫وتوفيرها‬ ‫بالسرعة‬
‫أكثر‬ ‫الذاكرة‬ ‫يستهلك‬ ‫انه‬ ‫إال‬ ‫أيضا‬ ‫بالسرعة‬ ‫الثالثة‬ ‫نظرائه‬ ‫على‬ ‫األخير‬ ‫تفوق‬ ‫من‬.
‫التقسيم‬partitioning :
‫أسلوب‬ ‫يعتمد‬Quicksort‫دا‬ ‫للعناصر‬ ‫ترتيب‬ ‫على‬ ‫تحصل‬ ‫حتى‬ ‫مرات‬ ‫لعدة‬ ‫المجزأ‬ ‫وتجزئة‬ ‫المقسم‬ ‫تقسيم‬ ‫على‬‫خل‬
‫تنازليا‬ ‫أو‬ ‫تصاعديا‬ ‫القائمة‬.
‫التقسيم‬ ‫محور‬ ‫مايسمى‬ ‫يكون‬ ‫هناك‬ ‫حيث‬ ‫وأكبر‬ ‫أصغر‬ ‫جزأين‬ ‫إلى‬ ‫قائمة‬ ‫تقسيم‬ ‫هو‬ ‫هنا‬ ‫التقسيم‬(pivot )‫يتم‬ ‫وعليها‬
‫تصاع‬ ‫ترتيبا‬ ‫مرتبة‬ ‫أو‬ ‫متساوية‬ ‫القسمين‬ ‫كال‬ ‫في‬ ‫العناصر‬ ‫عدد‬ ‫تكون‬ ‫أن‬ ‫يشترط‬ ‫ال‬ ‫أكبر‬ ‫أو‬ ‫أصغر‬ ‫تحديد‬‫بل‬ ‫تنازليا‬ ‫أو‬ ‫ديا‬
‫آخر‬ ‫قسم‬ ‫في‬ ‫واألكبر‬ ‫قسم‬ ‫في‬ ‫التقسيم‬ ‫محور‬ ‫من‬ ‫األصغر‬ ‫جعل‬ ‫هو‬ ‫التقسيم‬ ‫مرحلة‬ ‫في‬ ‫مهم‬ ‫هو‬ ‫ما‬.
‫ذلك‬ ‫على‬ ‫مثال‬‫من‬ ‫أقل‬ ‫على‬ ‫الحاصلين‬ ‫الطالب‬ ‫درجات‬ ‫تقسيم‬50‫من‬ ‫أكثر‬ ‫على‬ ‫والحاصلين‬ ‫درجة‬50‫حيث‬ ‫درجة‬
‫القيمة‬50‫التقسيم‬ ‫محور‬ ‫هو‬.
------------------------------------------
‫بمعدل‬ ‫المصفوفة‬ ‫بترتيب‬ ‫الخوارزم‬ ‫هذا‬ ‫يقوم‬n log n ‫حيث‬ ‫خطوة‬n ‫المصفوفة‬ ‫عناصر‬ ‫عدد‬ ‫هي‬..
‫بمعنى‬:
‫بها‬ ‫مصفوفة‬ ‫لدينا‬ ‫كان‬ ‫إذا‬128‫في‬ ‫بترتيها‬ ‫سيقوم‬ ‫الخورازم‬ ‫هذا‬ ‫فإن‬ ‫عنصر‬896‫خطوة‬..
‫األخرى‬ ‫الترتيب‬ ‫خوارزميات‬ ‫ب‬ ‫قورن‬ ‫ما‬ ‫إذا‬ ‫جدا‬ ‫مناسبا‬ ‫العدد‬ ‫هذا‬ ‫يعتبر‬ ‫و‬
‫خوارزم‬ ‫في‬ ‫المثال‬ ‫سبيل‬ ‫فعلى‬Bubble sort ‫إلى‬ ‫سنحتاج‬16384‫األحوال‬ ‫من‬ ‫حال‬ ‫بأي‬ ‫في‬ ‫خطوة‬..