Chapter 14: Sorting and Searching
This chapter covers the most popular sorting and searching algorithms that are encountered in technical interviews. We will cover sorting algorithms such as Merge Sort, Quick Sort, Radix Sort, Heap Sort, and Bucket Sort, and searching algorithms such as Binary Search.
By the end of this chapter, you should be able to tackle a wide range of problems that involve sorting and searching algorithms. We'll cover the following topics:
- Sorting algorithms
- Searching algorithms
- Coding challenges
Let's get started!
Technical requirements
You can find all the code files for this chapter on GitHub at https://github.com/PacktPublishing/The-Complete-Coding-Interview-Guide-in-Java/tree/master/Chapter14.
Sorting algorithms ...
Get The Complete Coding Interview Guide in Java 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.
