Quick sort is a sorting algorithm that uses divide-and-conquer to partition an array into two sub-arrays based on a pivot element, and then recursively sorts the sub-arrays. It works by picking a pivot element, partitioning the array into elements less than or equal to the pivot and elements greater than the pivot, and then applying quicksort recursively on the two sub-arrays. Quick sort has an average time complexity of O(nlogn) and is often faster in practice than other popular sorting algorithms like merge sort and heap sort.

1. National Institute of Textile Engineering & Research
Department of Computer Science and Engineering
Course title: Data Structure and Algorithms
Course code: CSE 1201
Submitted by : Submitted to
Name : Samiul Hasan
ID: CS 2102013
Anichur Rahman
Lecturer , NITER

2. Quick Sort
CONTENTS
• What is Quick Sort
• Algorithm
• Working procedure at a glance
• Pseudocode
• Divide-and-conqure procedure
• Conclusion

3. What is Quick Sort
Quick sort is a sorting algorithm that uses the divide-and-conquer
strategy to sort an array by partitioning it into two sub-arrays and
recursively sorting them.

4. Algorithm
Given an array of n elements (e.g., integers):
• If array only contains one element, return
• Else
• pick one element to use as pivot.
• Partition elements into two sub-arrays:
• Elements less than or equal to pivot
• Elements greater than pivot
Quicksort two sub-arrays

5. Working procedure of quick sort
[8, -2, 5, 2, 6, 7, 1, 3]
3
-2,2,1 8,5,6,7
5,6
-2 2
1
7
6
8
5

6. Pseudocode:

7. Array Partitioning
According to pseudocode let we got a array:
8 -2 5 2 6 7 1 3

8. Suppose the given array is :
8 -2 5 2 6 7 1 3
pivot

9. Suppose the given array is :
8 -2 5 2 6 7 1 3
8
-2
5
2
6 7
3
1

10. Suppose the given array is :
8 -2 5 2 6 7 1 3
8
-2 5
2 6 7
3
1
-2 2
1

11. Suppose the given array is :
8 -2 5 2 6 7 1 3
8
-2 5
2 6 7
3
1
-2 2
1
5
8
6
7

12. Suppose the given array is :
8 -2 5 2 6 7 1 3
8
-2
5
2
6 7
3
1
-2 2
1
5 8
6
7
5
6

13. Conquer Stage:
-2 2
1
8
7
5 6
-2 1 2

14. -2 2
1
8
7
5 6
-2 1 2
5 6

15. -2 2
1
8
7
5 6
-2 1 2
5 6 8

16. -2 2
1
8
7
5 6
-2 1 2
5 6 8
-2 1 2 5 6 8

17. Code

18. Conclusion
Quick Sort is a widely used sorting algorithm that follows the divide-and-conquer approach,
recursively dividing the input array into two smaller sub-arrays and sorting them based on a
chosen pivot element. It has an average time complexity of O(nlogn) and is often faster in
practice than other popular sorting algorithms like Merge Sort and Heap Sort.

19. Thank You