Introduction to Quick Sort Algorithm, Slides of Data Structures and Algorithms

Download Introduction to Quick Sort Algorithm and more Slides Data Structures and Algorithms in PDF only on Docsity!

Quick Sort

Introduction

• The algorithm is called as Quick sort or

partition exchange sort

• Pick an pivot element

• Partition an array into elements <pivot =pivot

and >pivot

• Quick sort this smaller separately

Example

Example for Practice