Get full access to C++ Data Structures and Algorithms and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

QA section

Can we sort the left sublist and right sublist from the partition method in quick sort using other sorting algorithms?
Suppose we have an array which consists of {4, 34, 29, 48, 53, 87, 12, 30, 44, 25, 93, 67, 43, 19, 74}. What sorting algorithm will give you the fastest time performance?
Why can merge sort and quick sort have O(N • log N) for their time complexity?
What sorting algorithm is similar to arranging a hand of poker cards?
What is the best sorting algorithm if we are going to sort an array which consists of {293, 21, 43, 1024, 8, 532, 70, 8283}?

Get C++ Data Structures and Algorithms now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

It’s yours, free.

Get it now

Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.

Start your free trial Become a member now