Divide and Conquer
Binary search, merge sort, Strassen, closest pair.
Log in to read this chapter
This chapter is part of GATE Computer Science. Log in to continue reading the full lessons, notes and practice.
What you'll learn in this chapter
Divide and Conquer Paradigm and Recurrences
Sorting by Divide and Conquer
Searching, Selection and Inversions
Classic Divide and Conquer Algorithms