Binary Search Time Complexity Analysis
Since, at each step the size of the (searchable) array is reduced to half (1/2), we could write the following recurrence relation for the Binary Search Algorithm
Category: Divide and Conquer
Binary Search Explained | LeetCode Solution
Binary Search is a divide and conquer algorithm that finds a particular element within a sorted array or a given integer range.
Strassen’s Algorithm for Matrix Multiplication
Strassen’s Algorithm for Matrix multiplication is a recursive algorithm for multiplying n x n matrices. Strassen’s algorithm is based on a familiar design technique – Divide & Conquer.