April 2018
Intermediate to advanced
322 pages
6h 57m
English
Content preview from C++ Data Structures and Algorithms
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
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}?