SlideShare une entreprise Scribd logo

Quick sort

•Télécharger en tant que PPTX, PDF•
•
J
Jehat Hassan

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.

Technologie
1  sur  119
Queck Sort Jehat Hassan Serbast Hamid Serhldan Salih Walid Abduljabar
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.
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.
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 ..
What is Quick Sort ?? p numbers less than p numbers greater than or equal to p p
Quick Sort 41 62 3513 28579684 79
Quick Sort 41 62 3513 28579684 79 Pivot = 41
Quick Sort 41 62 3513 28579684 79 Pivot = 41 i
Quick Sort 41 62 3513 28579684 79 Pivot = 41 i j
Quick Sort 41 62 3513 28579684 79 Pivot = 41 i j 41>79 ??
Quick Sort 41 62 3513 28579684 79 Pivot = 41 i j 41>79 ?? Fals
Quick Sort 41 62 3513 28579684 Pivot = 41 i j j-- 79
Quick Sort 41 62 3513 28579684 Pivot = 41 i j 79 41>28 ??
Quick Sort 41 62 3513 28579684 Pivot = 41 i j 79 41>28 ?? True
Quick Sort 41 62 3513 28579684 Pivot = 41 i j 79
Quick Sort 4162 351328 579684 Pivot = 41 i j 79 Pivot = j
Quick Sort 4162 351328 579684 Pivot = 41 i j 79 i++
Quick Sort 4162 351328 579684 Pivot = 41 i j 79 62>41 ??
Quick Sort 4162 351328 579684 Pivot = 41 i j 79 62>41 ?? True
Quick Sort 4162 351328 579684 Pivot = 41 i j 79
Quick Sort 41 351328 579684 Pivot = 41 i j 79 Pivot = i 62
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 j--
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>57 ??
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>57 ?? Fals
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 j--
Quick Sort 41 351328 579684 Pivot = 41 i j 7962
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>96 ??
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>96 ?? Fals
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 j--
Quick Sort 41 351328 579684 Pivot = 41 i j 7962
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>35 ??
Quick Sort 41 351328 579684 Pivot = 41 i j 7962 41>35 ?? True
Quick Sort 41 351328 579684 Pivot = 41 i j 7962
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 Pivot = j
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 i++
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 13>41 ??
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 13>41 ?? Fals
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 i++
Quick Sort 35 1328 579684 Pivot = 41 i j 796241 84>41 ??
Quick Sort 35 1328 579684 Pivot = 41 i j 796241
Quick Sort 35 1328 5796 Pivot = 41 i j 796241 84
Quick Sort 35 1328 5796 Pivot = 41 i j 796241 84 j++
Quick Sort 35 1328 5796 Pivot = 41 i j 796241 84 i=j
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]
Quick Sort 35 1328 5796 Pivot = 41 796241 84 a[0] a[1] a[2]
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]
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
Quick Sort 35 1328 5796 796241 84 Now we sort numbers less than p
Quick Sort 35 1328 5796 796241 84 Pivot = 28
Quick Sort 5796 796241 84 Pivot = 28 i 35 1328
Quick Sort 35 1328 5796 796241 84Pivot = 28 i j
Quick Sort 35 1328 5796 796241 84Pivot = 28 i j 28>13 ??
Quick Sort 35 1328 5796 796241 84Pivot = 28 i j 28>13 ?? True
Quick Sort 35 1328 5796 796241 84Pivot = 28 i j
Quick Sort 3513 5796 796241 84Pivot = 28 i j 28 Pivot = j
Quick Sort 3513 5796 796241 84Pivot = 28 i j 28 i++
Quick Sort 3513 5796 796241 84Pivot = 28 i j 28 35>28 ?? True
Quick Sort 3513 5796 796241 84Pivot = 28 i j 28
Quick Sort 13 5796 796241 84Pivot = 28 i j 28 35
Quick Sort 13 5796 796241 84 28 35 a[0] a[0] a[0]
Quick Sort 13 5796 7962 41 84 28 35 Now we sort numbers greater than or equal to p
Quick Sort 13 5796 7962 41 84 28 35 a[0] a[1] a[2] a[3] a[4]
Quick Sort 13 5796 7962 41 84 28 35 Pivot = 84
Quick Sort 13 5796 7962 41 84 28 35 i=84 j=79 i j
Quick Sort 13 5796 7962 41 84 28 35 i j 84>79 ??
Quick Sort 13 5796 7962 41 84 28 35 i j 84>79 ?? True
Quick Sort 13 5796 7962 41 84 28 35 i j
Quick Sort 13 579679 62 41 84 28 35 i j
Quick Sort 13 579679 62 41 84 28 35 i j
Quick Sort 13 579679 62 41 84 28 35 i j i=96
Quick Sort 13 579679 62 41 84 28 35 i j 96>84 ??
Quick Sort 13 579679 62 41 84 28 35 i j 96>84 ?? True
Quick Sort 13 579679 62 41 84 28 35 i j
Quick Sort 13 5779 62 41 84 28 35 i j 96
Quick Sort 13 5779 62 41 84 28 35 i j 96 j--
Quick Sort 13 5779 62 41 84 28 35 i j 96 84>62 ??
Quick Sort 13 5779 62 41 84 28 35 i j 96 84>62 ?? True
Quick Sort 13 5779 62 41 84 28 35 i j 96
Quick Sort 13 5779 62 4128 35 i j 9684
Quick Sort 13 5779 62 4128 35 i j 9684 i++
Quick Sort 13 5779 62 4128 35 i j 9684 57>84 ??
Quick Sort 13 5779 62 4128 35 i j 9684 57>84 ?? Fals e
Quick Sort 13 5779 62 4128 35 i j 9684
Quick Sort 13 5779 62 4128 35 i j 9684 i++
Quick Sort 13 5779 62 4128 35 i j 9684 i=j
Quick Sort 13 5779 62 4128 35 i j 9684 a[0] a[1] a[2] a[0] a[0]
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
Quick Sort 13 5779 62 4128 35 96 84
Quick Sort 13 5779 624128 35 96 84 Now we sort numbers greater than or equal to p
Quick Sort 13 5779 624128 35 96 84 i j i=j=96
Quick Sort 13 5779 62 4128 35 9684 Now we sort numbers less than p
Quick Sort 13 5779 62 4128 35 9684 i j Pivot = 79
Quick Sort 13 5779 62 4128 35 9684 i j 79>57 ??
Quick Sort 13 5779 62 4128 35 9684 i j 79>57 ?? True
Quick Sort 13 5779 62 4128 35 9684 i j
Quick Sort 13 62 4128 35 9684 i j 7957
Quick Sort 13 62 4128 35 9684 i j 7957 i++
Quick Sort 13 62 4128 35 9684 i j 7957 62>79 ??
Quick Sort 13 62 4128 35 9684 i j 7957 62>79 ?? Fals e
Quick Sort 13 62 4128 35 9684 i j 7957 i++
Quick Sort 13 62 4128 35 9684 i j 7957 i=j
Quick Sort 13 62 4128 35 9684 7957 a[0] a[1] a[0]
Quick Sort 13 62 4128 35 9684 7957 a[0] a[1] a[0] numbers less than p
Quick Sort 13 62 4128 35 968479 57
Quick Sort 13 62 4128 35 968479 57 Now we sort numbers less than p
Quick Sort 13 62 4128 35 968479 57 i=84 j=79 Pivot = 84 i j
Quick Sort 13 62 4128 35 968479 57 i j 57>62 ?? False
Quick Sort 13 62 4128 35 968479 57 i j j--
Quick Sort 13 62 4128 35 968479 57 i j i=j
Quick Sort 13 62 4128 35 968479 57 numbers greater than or equal to p
Quick Sort 13 62 4128 35 96847957 Now we sort numbers greater than or equal to p
Quick Sort 13 62 4128 35 96847957 i=79 j=79 Pivot = 79 i j
Quick Sort 13 62 4128 35 96847957 i j i=j
Quick Sort 13 62 4128 35 96847957
Quick Sort 13 624128 35 96847957 a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8]
Do you understand Quick Sort ?
If you do not understand......... See this video..... And do not laugh ;)
‫؟‬ ‫السريع‬ ‫الفرز‬ ‫أسلوب‬ ‫لماذا‬ ‫األسرع‬ ‫ألنها‬ ‫األخرى‬ ‫الفرز‬ ‫خوارزميات‬ ‫جميع‬ ‫من‬ ‫استخداما‬ ‫األكثر‬ ‫يعتبر‬ ‫السريع‬ ‫الفرز‬ ‫بأسلوب‬ ‫الترتيب‬‫وأقل‬ ‫للذاكرة‬ ‫استهالكا‬. ‫الفقاعة‬ ‫بأسلوب‬ ‫الفرز‬ ‫على‬ ‫تتفوق‬ ‫هي‬ ‫إذ‬(bubble sort)‫اإلدخال‬ ‫بأسلوب‬ ‫الفرز‬ ‫و‬(insertion sort)‫بأسلوب‬ ‫الفرز‬ ‫و‬ ‫االختيار‬(selection sort )‫الدمج‬ ‫بأسلوب‬ ‫الفرز‬ ‫عن‬ ‫وتتميز‬ ‫بالسرعة‬(merge sort)‫بالرغم‬ ‫للذاكرة‬ ‫وتوفيرها‬ ‫بالسرعة‬ ‫أكثر‬ ‫الذاكرة‬ ‫يستهلك‬ ‫انه‬ ‫إال‬ ‫أيضا‬ ‫بالسرعة‬ ‫الثالثة‬ ‫نظرائه‬ ‫على‬ ‫األخير‬ ‫تفوق‬ ‫من‬. ‫التقسيم‬partitioning : ‫أسلوب‬ ‫يعتمد‬Quicksort‫دا‬ ‫للعناصر‬ ‫ترتيب‬ ‫على‬ ‫تحصل‬ ‫حتى‬ ‫مرات‬ ‫لعدة‬ ‫المجزأ‬ ‫وتجزئة‬ ‫المقسم‬ ‫تقسيم‬ ‫على‬‫خل‬ ‫تنازليا‬ ‫أو‬ ‫تصاعديا‬ ‫القائمة‬. ‫التقسيم‬ ‫محور‬ ‫مايسمى‬ ‫يكون‬ ‫هناك‬ ‫حيث‬ ‫وأكبر‬ ‫أصغر‬ ‫جزأين‬ ‫إلى‬ ‫قائمة‬ ‫تقسيم‬ ‫هو‬ ‫هنا‬ ‫التقسيم‬(pivot )‫يتم‬ ‫وعليها‬ ‫تصاع‬ ‫ترتيبا‬ ‫مرتبة‬ ‫أو‬ ‫متساوية‬ ‫القسمين‬ ‫كال‬ ‫في‬ ‫العناصر‬ ‫عدد‬ ‫تكون‬ ‫أن‬ ‫يشترط‬ ‫ال‬ ‫أكبر‬ ‫أو‬ ‫أصغر‬ ‫تحديد‬‫بل‬ ‫تنازليا‬ ‫أو‬ ‫ديا‬ ‫آخر‬ ‫قسم‬ ‫في‬ ‫واألكبر‬ ‫قسم‬ ‫في‬ ‫التقسيم‬ ‫محور‬ ‫من‬ ‫األصغر‬ ‫جعل‬ ‫هو‬ ‫التقسيم‬ ‫مرحلة‬ ‫في‬ ‫مهم‬ ‫هو‬ ‫ما‬. ‫ذلك‬ ‫على‬ ‫مثال‬‫من‬ ‫أقل‬ ‫على‬ ‫الحاصلين‬ ‫الطالب‬ ‫درجات‬ ‫تقسيم‬50‫من‬ ‫أكثر‬ ‫على‬ ‫والحاصلين‬ ‫درجة‬50‫حيث‬ ‫درجة‬ ‫القيمة‬50‫التقسيم‬ ‫محور‬ ‫هو‬. ------------------------------------------ ‫بمعدل‬ ‫المصفوفة‬ ‫بترتيب‬ ‫الخوارزم‬ ‫هذا‬ ‫يقوم‬n log n ‫حيث‬ ‫خطوة‬n ‫المصفوفة‬ ‫عناصر‬ ‫عدد‬ ‫هي‬.. ‫بمعنى‬: ‫بها‬ ‫مصفوفة‬ ‫لدينا‬ ‫كان‬ ‫إذا‬128‫في‬ ‫بترتيها‬ ‫سيقوم‬ ‫الخورازم‬ ‫هذا‬ ‫فإن‬ ‫عنصر‬896‫خطوة‬.. ‫األخرى‬ ‫الترتيب‬ ‫خوارزميات‬ ‫ب‬ ‫قورن‬ ‫ما‬ ‫إذا‬ ‫جدا‬ ‫مناسبا‬ ‫العدد‬ ‫هذا‬ ‫يعتبر‬ ‫و‬ ‫خوارزم‬ ‫في‬ ‫المثال‬ ‫سبيل‬ ‫فعلى‬Bubble sort ‫إلى‬ ‫سنحتاج‬16384‫األحوال‬ ‫من‬ ‫حال‬ ‫بأي‬ ‫في‬ ‫خطوة‬..

Recommandé

Quick sort
Quick sortQuick sort
Quick sort
International Islamic University
 
Insertion sort
Insertion sortInsertion sort
Insertion sort
almaqboli
 
Quicksort Presentation
Quicksort PresentationQuicksort Presentation
Quicksort Presentation
irdginfo
 
Algorithm: Quick-Sort
Algorithm: Quick-SortAlgorithm: Quick-Sort
Algorithm: Quick-Sort
Tareq Hasan
 
Quick sort-Data Structure
Quick sort-Data StructureQuick sort-Data Structure
Quick sort-Data Structure
Jeanie Arnoco
 
Sorting Algorithms
Sorting AlgorithmsSorting Algorithms
Sorting Algorithms
Mohammed Hussein
 
Quick sort
Quick sortQuick sort
Quick sort
amar kakde
 
Selection sort algorithm presentation, selection sort example using power point
Selection sort algorithm presentation, selection sort example using power point Selection sort algorithm presentation, selection sort example using power point
Selection sort algorithm presentation, selection sort example using power point
University of Science and Technology Chitttagong
 

Recommandé

Quick sort
Quick sortQuick sort
Quick sort
International Islamic University
 
Insertion sort
Insertion sortInsertion sort
Insertion sort
almaqboli
 
Quicksort Presentation
Quicksort PresentationQuicksort Presentation
Quicksort Presentation
irdginfo
 
Algorithm: Quick-Sort
Algorithm: Quick-SortAlgorithm: Quick-Sort
Algorithm: Quick-Sort
Tareq Hasan
 
Quick sort-Data Structure
Quick sort-Data StructureQuick sort-Data Structure
Quick sort-Data Structure
Jeanie Arnoco
 
Sorting Algorithms
Sorting AlgorithmsSorting Algorithms
Sorting Algorithms
Mohammed Hussein
 
Quick sort
Quick sortQuick sort
Quick sort
amar kakde
 
Selection sort algorithm presentation, selection sort example using power point
Selection sort algorithm presentation, selection sort example using power point Selection sort algorithm presentation, selection sort example using power point
Selection sort algorithm presentation, selection sort example using power point
University of Science and Technology Chitttagong
 
Heap sort
Heap sortHeap sort
Heap sort
Mohd Arif
 
Insertion sort
Insertion sort Insertion sort
Insertion sort
Monalisa Patel
 
Linear search-and-binary-search
Linear search-and-binary-searchLinear search-and-binary-search
Linear search-and-binary-search
International Islamic University
 
Quick sort
Quick sortQuick sort
Quick sort
Afaq Mansoor Khan
 
Sorting algorithms
Sorting algorithmsSorting algorithms
Sorting algorithms
Eleonora Ciceri
 
Array data structure
Array data structureArray data structure
Array data structure
maamir farooq
 
Heaps
HeapsHeaps
Heaps
Hafiz Atif Amin
 
Quick sort algorithm using slide presentation , Learn selection sort example ...
Quick sort algorithm using slide presentation , Learn selection sort example ...Quick sort algorithm using slide presentation , Learn selection sort example ...
Quick sort algorithm using slide presentation , Learn selection sort example ...
University of Science and Technology Chitttagong
 
Algorithms Lecture 4: Sorting Algorithms I
Algorithms Lecture 4: Sorting Algorithms IAlgorithms Lecture 4: Sorting Algorithms I
Algorithms Lecture 4: Sorting Algorithms I
Mohamed Loey
 
Insertion sort algorithm power point presentation
Insertion sort algorithm power point presentation Insertion sort algorithm power point presentation
Insertion sort algorithm power point presentation
University of Science and Technology Chitttagong
 
Quick Sort
Quick SortQuick Sort
Quick Sort
priyankanaidu6
 
Radix sorting
Radix sortingRadix sorting
Radix sorting
Madhawa Gunasekara
 
Queues
QueuesQueues
Queues
Ashim Lamichhane
 
Analysis of Algorithm (Bubblesort and Quicksort)
Analysis of Algorithm (Bubblesort and Quicksort)Analysis of Algorithm (Bubblesort and Quicksort)
Analysis of Algorithm (Bubblesort and Quicksort)
Flynce Miguel
 
Divide and conquer - Quick sort
Divide and conquer - Quick sortDivide and conquer - Quick sort
Divide and conquer - Quick sort
Madhu Bala
 
Quick sort
Quick sortQuick sort
Quick sort
Abdelrahman Saleh
 
Infix prefix postfix
Infix prefix postfixInfix prefix postfix
Infix prefix postfix
Self-Employed
 
3.8 quicksort
3.8 quicksort3.8 quicksort
3.8 quicksort
Krish_ver2
 
Sorting Algorithms
Sorting AlgorithmsSorting Algorithms
Sorting Algorithms
Pranay Neema
 
Searching algorithms
Searching algorithmsSearching algorithms
Searching algorithms
Trupti Agrawal
 
Quicksort: illustrated step-by-step walk through
Quicksort: illustrated step-by-step walk throughQuicksort: illustrated step-by-step walk through
Quicksort: illustrated step-by-step walk through
Yoshi Watanabe
 
Quick Sort , Merge Sort , Heap Sort
Quick Sort , Merge Sort , Heap SortQuick Sort , Merge Sort , Heap Sort
Quick Sort , Merge Sort , Heap Sort
Mohammed Hussein
 

Contenu connexe

Tendances

Tendances (20)

Heap sort
Heap sortHeap sort
Heap sort
 
Insertion sort
Insertion sort Insertion sort
Insertion sort
 
Linear search-and-binary-search
Linear search-and-binary-searchLinear search-and-binary-search
Linear search-and-binary-search
 
Quick sort
Quick sortQuick sort
Quick sort
 
Sorting algorithms
Sorting algorithmsSorting algorithms
Sorting algorithms
 
Array data structure
Array data structureArray data structure
Array data structure
 
Heaps
HeapsHeaps
Heaps
 
Quick sort algorithm using slide presentation , Learn selection sort example ...
Quick sort algorithm using slide presentation , Learn selection sort example ...Quick sort algorithm using slide presentation , Learn selection sort example ...
Quick sort algorithm using slide presentation , Learn selection sort example ...
 
Algorithms Lecture 4: Sorting Algorithms I
Algorithms Lecture 4: Sorting Algorithms IAlgorithms Lecture 4: Sorting Algorithms I
Algorithms Lecture 4: Sorting Algorithms I
 
Insertion sort algorithm power point presentation
Insertion sort algorithm power point presentation Insertion sort algorithm power point presentation
Insertion sort algorithm power point presentation
 
Quick Sort
Quick SortQuick Sort
Quick Sort
 
Radix sorting
Radix sortingRadix sorting
Radix sorting
 
Queues
QueuesQueues
Queues
 
Analysis of Algorithm (Bubblesort and Quicksort)
Analysis of Algorithm (Bubblesort and Quicksort)Analysis of Algorithm (Bubblesort and Quicksort)
Analysis of Algorithm (Bubblesort and Quicksort)
 
Divide and conquer - Quick sort
Divide and conquer - Quick sortDivide and conquer - Quick sort
Divide and conquer - Quick sort
 
Quick sort
Quick sortQuick sort
Quick sort
 
Infix prefix postfix
Infix prefix postfixInfix prefix postfix
Infix prefix postfix
 
3.8 quicksort
3.8 quicksort3.8 quicksort
3.8 quicksort
 
Sorting Algorithms
Sorting AlgorithmsSorting Algorithms
Sorting Algorithms
 
Searching algorithms
Searching algorithmsSearching algorithms
Searching algorithms
 

En vedette

Selection sort
Selection sortSelection sort
Selection sort
Jay Patel
 

En vedette (20)

Quicksort: illustrated step-by-step walk through
Quicksort: illustrated step-by-step walk throughQuicksort: illustrated step-by-step walk through
Quicksort: illustrated step-by-step walk through
 
Quick Sort , Merge Sort , Heap Sort
Quick Sort , Merge Sort , Heap SortQuick Sort , Merge Sort , Heap Sort
Quick Sort , Merge Sort , Heap Sort
 
Quicksort
QuicksortQuicksort
Quicksort
 
Merge sort
Merge sortMerge sort
Merge sort
 
Selection sort
Selection sortSelection sort
Selection sort
 
Selection sort
Selection sortSelection sort
Selection sort
 
Bubble Sort
Bubble SortBubble Sort
Bubble Sort
 
Quick Sort
Quick SortQuick Sort
Quick Sort
 
Merge sort analysis and its real time applications
Merge sort analysis and its real time applicationsMerge sort analysis and its real time applications
Merge sort analysis and its real time applications
 
Insertion Sort
Insertion SortInsertion Sort
Insertion Sort
 
Quick sort Algorithm Discussion And Analysis
Quick sort Algorithm Discussion And AnalysisQuick sort Algorithm Discussion And Analysis
Quick sort Algorithm Discussion And Analysis
 
Selection sort
Selection sortSelection sort
Selection sort
 
Binary search tree(bst)
Binary search tree(bst)Binary search tree(bst)
Binary search tree(bst)
 
Knapsack Problem
Knapsack ProblemKnapsack Problem
Knapsack Problem
 
A Quick Taste of C
A Quick Taste of CA Quick Taste of C
A Quick Taste of C
 
Sorting algos
Sorting algosSorting algos
Sorting algos
 
Quick Sort
Quick SortQuick Sort
Quick Sort
 
5.3 dynamic programming
5.3 dynamic programming5.3 dynamic programming
5.3 dynamic programming
 
Quicksort
QuicksortQuicksort
Quicksort
 
Alpro : Quick sort
Alpro : Quick sortAlpro : Quick sort
Alpro : Quick sort
 

Similaire à Quick sort

Divide-and-conquer
Divide-and-conquerDivide-and-conquer
Divide-and-conquer
Mrunal Patil
 
Sorting and Searching - Data Structure - Notes
Sorting and Searching - Data Structure - NotesSorting and Searching - Data Structure - Notes
Sorting and Searching - Data Structure - Notes
Omprakash Chauhan
 
Learn about algorithm
Learn about algorithm Learn about algorithm
Learn about algorithm
farrukh ishaq choudhary
 

Similaire à Quick sort (20)

Quick sort
Quick sortQuick sort
Quick sort
 
Divide-and-conquer
Divide-and-conquerDivide-and-conquer
Divide-and-conquer
 
Sorting
SortingSorting
Sorting
 
CS253: Divide & Conquer Sort (2019)
CS253: Divide & Conquer Sort (2019)CS253: Divide & Conquer Sort (2019)
CS253: Divide & Conquer Sort (2019)
 
Data Structure Sorting
Data Structure SortingData Structure Sorting
Data Structure Sorting
 
Sortings .pptx
Sortings .pptxSortings .pptx
Sortings .pptx
 
Different Sorting tecniques in Data Structure
Different Sorting tecniques in Data StructureDifferent Sorting tecniques in Data Structure
Different Sorting tecniques in Data Structure
 
Sorting and Searching - Data Structure - Notes
Sorting and Searching - Data Structure - NotesSorting and Searching - Data Structure - Notes
Sorting and Searching - Data Structure - Notes
 
Sorting in data structures and algorithms , it has all the necessary points t...
Sorting in data structures and algorithms , it has all the necessary points t...Sorting in data structures and algorithms , it has all the necessary points t...
Sorting in data structures and algorithms , it has all the necessary points t...
 
Ppt bubble sort
Ppt bubble sortPpt bubble sort
Ppt bubble sort
 
Data Structures- Part4 basic sorting algorithms
Data Structures- Part4 basic sorting algorithmsData Structures- Part4 basic sorting algorithms
Data Structures- Part4 basic sorting algorithms
 
Class13_Quicksort_Algorithm.pdf
Class13_Quicksort_Algorithm.pdfClass13_Quicksort_Algorithm.pdf
Class13_Quicksort_Algorithm.pdf
 
Sorting
SortingSorting
Sorting
 
Sorting
SortingSorting
Sorting
 
Sorting
SortingSorting
Sorting
 
Learn about algorithm
Learn about algorithm Learn about algorithm
Learn about algorithm
 
Sorting
SortingSorting
Sorting
 
Sorting Methods.pptx
Sorting Methods.pptxSorting Methods.pptx
Sorting Methods.pptx
 
Data Structure (MC501)
Data Structure (MC501)Data Structure (MC501)
Data Structure (MC501)
 
Presentation on binary search, quick sort, merge sort and problems
Presentation on binary search, quick sort, merge sort and problemsPresentation on binary search, quick sort, merge sort and problems
Presentation on binary search, quick sort, merge sort and problems
 

Dernier

Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
sammart93
 
Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
WSO2
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FMECloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
 
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamDEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
UiPathCommunity
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FMECloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
 
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Orbitshub
 

Dernier (20)

Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Exploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with MilvusExploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with Milvus
 
CNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In PakistanCNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In Pakistan
 
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
 
Exploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone ProcessorsExploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone Processors
 
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWEREMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
 
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
 
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptxCorporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FMECloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
MS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectorsMS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectors
 
[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdf[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdf
 
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamDEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
 
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost SavingRepurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
 
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FMECloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
Artificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : UncertaintyArtificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : Uncertainty
 
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUKSpring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
 
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
 

Quick sort