Divide and Conquer Sorting Algorithms

Divide and conquer is a problem-solving technique that involves breaking down a complex problem into smaller subproblems and solving each subproblem independently.

Merge Sort
A sorting algorithm that divides the input array into two halves, sorts each half, and then merges the two sorted halves into a single sorted array.

Quick Sort
A sorting algorithm that selects a pivot element and partitions the array into two parts, with elements smaller than the pivot on one side and elements larger on the other. The two parts are then recursively sorted.

Binary Search
A search algorithm that finds an element in a sorted array by dividing the search space in half with each iteration.