Sorry, this page is no longer available
We may earn an affiliate commission when you visit our partners.

Quicksort

Save
May 1, 2024 4 minute read

Quicksort is a highly efficient sorting algorithm that is widely used in computer science. It is a divide-and-conquer algorithm that operates by partitioning an array into two subarrays, one containing elements that are less than a chosen pivot element and the other containing elements that are greater than the pivot. This partitioning process is then recursively applied to the subarrays, resulting in a sorted array.

How Quicksort Works

The Quicksort algorithm begins by selecting a pivot element from the array. The pivot element is typically chosen as the last element of the array, but it can be any element. The array is then partitioned into two subarrays, one containing elements that are less than the pivot and the other containing elements that are greater than the pivot.

Share

Help others find this page about Quicksort: by sharing it with your friends and followers:

Reading list

We've selected 11 books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in Quicksort.
This standalone volume from Knuth's classic series focuses exclusively on quicksort. It provides a detailed analysis of the algorithm's performance and includes numerous exercises and open problems, making it a must-read for researchers and enthusiasts.
This classic textbook comprehensive introduction to the field of algorithms, including a thorough treatment of quicksort. It provides detailed explanations, pseudocode, and exercises, making it a valuable resource for students and professionals alike.
This popular textbook provides a clear and concise introduction to algorithms, including quicksort. It features numerous examples, exercises, and interactive visualizations, making it a great choice for students and beginners.
This widely used textbook covers a wide range of data structures and algorithms, including quicksort. It features clear explanations, code examples in Java, and exercises, making it suitable for both students and professionals.
Provides a comprehensive introduction to data structures and algorithms in Python. It includes a chapter on quicksort, discussing its implementation and performance characteristics.
Covers parallel algorithms, including a section on parallel quicksort. It discusses different parallelization techniques and their performance implications.
This practical guide provides a concise overview of a wide range of algorithms, including quicksort. It features code examples in C++ and Java, making it accessible to programmers of all levels.
Table of Contents
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser