‘Recent Articles’ on Divide and Conquer

Topic :

Standard Algorithms :

  1. Intoduction to Divide and Conquer
  2. Binary Search
  3. Merge Sort
  4. Quick Sort
  5. Calculate pow(x, n)
  6. Closest Pair of Points
  7. Strassen’s Matrix Multiplication
  8. Karatsuba algorithm for fast multiplication
  9. Count Inversions
  10. Multiply two polynomials
  11. Tiling Problem
  12. Convex Hull (Simple Divide and Conquer Algorithm)
  13. Quickhull Algorithm for Convex Hull

Binary Search Based :

  1. Median of two sorted arrays
  2. Median of two sorted arrays of different sizes
  3. Check for Majority Element in a sorted array
  4. Count number of occurrences (or frequency) in a sorted array
  5. Find a Fixed Point
  6. Closest Pair of Points | O(nlogn) Implementation
  7. Find the maximum element in an array which is first increasing and then decreasing
  8. Find a peak element
  9. Find the number of zeroes
  10. Find the minimum element in a sorted and rotated array
  11. Find the point where a monotonically increasing function becomes positive first time
  12. Find the missing number in Arithmetic Progression
  13. Floor in a Sorted Array
  14. Find the element that appears once in a sorted array
  15. Find the only repeating element in a sorted array of size n
  16. K-th Element of Two Sorted Arrays
  17. Find index of an extra element present in one sorted array
  18. Find bitonic point in given bitonic sequence
  19. Find the Rotation Count in Rotated Sorted array

>> More

Misc :

  1. Largest Rectangular Area in a Histogram | Set 1
  2. Maximum and minimum of an array using minimum number of comparisons
  3. Write you own Power without using multiplication(*) and division(/) operators
  4. Program to count number of set bits in an (big) array
  5. Maximum Subarray Sum
  6. Search in a Row-wise and Column-wise Sorted 2D Array
  7. The Skyline Problem
  8. Square root of an integer
  9. Longest Common Prefix
  10. Find frequency of each element in a limited range array in less than O(n) time
  11. Find cubic root of a number
  12. Minimum difference between adjacent elements of array which contain elements from each row of a matrix
  13. Easy way to remember Strassen’s Matrix Equation
  14. Allocate minimum number of pages
  15. Place k elements such that minimum distance is maximized
  16. Search element in a sorted matrix
  17. Find a peak element in a 2D array
  18. Collect all coins in minimum number of steps
  19. Shuffle 2n integers in format {a1, b1, a2, b2, a3, b3, ……, an, bn} without using extra space

Quick Links :

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Company Wise Coding Practice    Topic Wise Coding Practice