Advanced Sorting

If you follow the latest happenings with the book, you've probably received news about the latest update. Available in digital, print and code format, this new update extends the introductory content on sorting with the advanced quicksort algorithm. Unlike algorithms like insertion sort and bubble sort, the quicksort technique applies a divide & conquer strategy and has an average time complexity of O (n log n). Existing readers can enjoy this new chapter with color illustrations and the latest Swift 3.0 code.

Already had a chance to pre-order a printed book? This new content will be included when we start shipping books later this month.

Posted on October 5, 2016 .