Divide and Conquer Algorithms

Home > Computer Science > Software Engineering > Algorithms > Divide and Conquer Algorithms

These are used to break down a problem into smaller sub-problems that are easier to solve. Examples include the Merge Sort algorithm and the Binary Search algorithm.