Recursive Algorithms for Speed

Exercises for Chapter #10 of A Common-Sense Guide To Data Structures and Algorithms

Get The Book!

Chapter Exercises

Exercise #1

Describe the exact steps that Quicksort would take for the following array: [90, 100, 20, 60, 80, 110, 120, 40, 10, 30, 50, 70].

Exercise #2

Create a table that compares the best-, middle-, and worst-case scenarios for Bubble Sort, Selection Sort, Insertion Sort, and Quicksort.

Exercise #3

Describe the exact steps that Quickselect would take for the second-to-lowest value in the following array: [90, 100, 20, 60, 80, 110, 120, 40, 10, 30, 50, 70].

Let's Get In Touch!

Join the forum on The Pragmatic Programmers website to join in on the conversation about this book, or email Jay Wengrow, author of the book and this website directly.