This book "Mastering Quick Sort" is the only book you need to master Quick Sort along with its detailed analysis.

Quick Sort is the most asked topic in Coding Interviews and is equally challenging. This book help you understand all core concepts, in-depth complexity analysis and advanced research direction as well.
Each concept introduced in this book is supported with sample implementations which help you get practical experience.

We have covered variants of Quick Sort such as:

• 3 way Partitioning Quick Sort

• Dual-Pivot Quick Sort

• Parallel Quick Sort (3 techniques)

Which help in improving the performance further.
We have presented MCQs at the end of the book which help you test your core concepts.

This is a MUST READ for Coding Interviews and mastery in the field of Algorithms.
Get started with this book and change the equation of your career.

Book: Mastering Quick Sort
Authors (3): Aditya Chatterjee, Ue Kiao, Geoffrey Ziskovin

About the authors:
Aditya Chatterjee is an Independent Researcher, Technical Author and the Founding Member of OPENGENUS, a scientific community focused on Computing Technology.
Ue Kiao is a Japanese Software Developer and has played key role in designing systems like TaoBao, AliPay and many more. She has completed her B. Sc in Mathematics and Computing Science at National Taiwan University and PhD at Tokyo Institute of Technology.
Geoffrey Ziskovin is an American Software Engineer with an experience of over 30 years. He has interviewed over 700 candidates worldwide for various Fortune 500 companies.

Contributors (8): Shubhankar Maurya, Vikram Shishupalsingh Bais, Mohd Ehtesham Uddin Qureshi, Shlok Singh, Aravind Mohandas, Tushti, Vansh Pratap Singh, Nico Lomuto

Thank you to Nico Lomuto (creator of Lomuto Partition which is often used in Quick Sort) for his inputs in preparing this exclusive book on Quick Sort.

Published: July 2022 (Edition 1)
Publisher: © OpenGenus

Table of contents:

• INTRODUCTION

• UNDERSTANDING QUICK SORT

• Time Complexity Analysis of Quick Sort

• Space Complexity

• Comparison with other sorting algorithms

• QUICK SORT ON LINKED LIST

• QuickSort on Linked List vs Array

• Time and Space Complexity of Quick Sort on Linked List

• Different Pivot Selection in Quick Sort

• Choosing a Good Pivot

• Choosing a Bad Pivot

• Different Pivot Selection Techniques

• Median as Pivot

• Median-of-three method for Pivot in Quick Sort

• Median-of-five with random index selection method

• Median-of-five without random index selection method

• Mean as Pivot

• Mode as Pivot

• i-th Element as Pivot

• Largest/ Smallest Element

• Median of Medians Algorithm

• What is median of medians heuristic?

• Why you may need "Median of Medians"?

• Median of Medians Algorithm

• Pseudocode of Median of Medians Algorithm

• Time and Space Complexity of Median of Medians Algorithm

• Proofs: Why is this pivot good?

• Partition Algorithms for Quick Sort

• Hoare Partition Algorithm

• Lomuto Partition

• 3 Way Partitioning Quick Sort

• Quick Sort with two pivots (Dual-Pivot)

• Parallel Quick Sort

• Approach 1: Naive Parallel Quick Sort

• Approach 2: Optimized Parallel Quick Sort

• Approach 3: using both sequential and parallel approaches

• Approach 4: Hyperquicksort

• Concluding Note

• We started tracking this book on November 3, 2022.
• This book was $5.00 when we started tracking it.
• The price of this book has changed one time in the past 1,067 days.
• The current price of this book is $7.00 last checked one day ago.
• This book is currently at its highest price since we started tracking it.

• Computers & TechnologyProgrammingAlgorithms

• Text-to-Speech: Disabled
• Lending: Disabled
• Print Length: 123 Pages
• File Size: 20 KB