Divide and Conquer Programs in C for Freshers
Basic Divide and Conquer Programs
Divide and Conquer is an algorithmic paradigm that recursively breaks down a problem into subproblems until they become simple enough to solve directly.
| # | Program Name | Description | Resources |
|---|---|---|---|
| 1 | Binary Search | Implement binary search algorithm | GeeksforGeeks |
| 2 | Merge Sort | Implement merge sort algorithm | GeeksforGeeks |
| 3 | Quick Sort | Implement quick sort algorithm | GeeksforGeeks |
| 4 | Closest Pair of Points | Find closest pair of points in 2D plane | GeeksforGeeks |
| 5 | Strassen's Matrix Multiplication | Matrix multiplication using Strassen's algorithm | GeeksforGeeks |
| 6 | Power of a Number | Calculate x^n using divide and conquer | GeeksforGeeks |
| 7 | Fibonacci Series | Find nth Fibonacci number | GeeksforGeeks |
| 8 | Karatsuba Algorithm | Fast multiplication algorithm | GeeksforGeeks |
| 9 | Maximum Subarray Sum | Find maximum contiguous subarray sum | GeeksforGeeks |
| 10 | Tower of Hanoi | Solve Tower of Hanoi problem | GeeksforGeeks |
| 11 | Find Peak Element | Find a peak element in an array | GeeksforGeeks |
| 12 | Majority Element | Find majority element in an array | GeeksforGeeks |
| 13 | Find Minimum in Rotated Sorted Array | Find minimum element in rotated sorted array | GeeksforGeeks |
| 14 | Search in Rotated Sorted Array | Search element in rotated sorted array | GeeksforGeeks |
| 15 | Median of Two Sorted Arrays | Find median of two sorted arrays | GeeksforGeeks |
| 16 | Convex Hull | Find convex hull of a set of points | GeeksforGeeks |
| 17 | Counting Inversions | Count inversions in an array | GeeksforGeeks |
| 18 | Skyline Problem | Solve the skyline problem | GeeksforGeeks |
| 19 | Fast Fourier Transform | Implement FFT algorithm | GeeksforGeeks |
| 20 | Closest Pair in 3D | Find closest pair of points in 3D space | GeeksforGeeks |
| 21 | Binary Tree Traversals | Implement tree traversals using recursion | GeeksforGeeks |
| 22 | Height of Binary Tree | Calculate height of binary tree | GeeksforGeeks |
| 23 | Diameter of Binary Tree | Find diameter of binary tree | GeeksforGeeks |
| 24 | Lowest Common Ancestor | Find LCA of two nodes in binary tree | GeeksforGeeks |
| 25 | Check Balanced Binary Tree | Check if binary tree is balanced | GeeksforGeeks |
| 26 | Matrix Search | Search in row-wise and column-wise sorted matrix | GeeksforGeeks |
| 27 | Kth Smallest in Matrix | Find kth smallest element in sorted matrix | GeeksforGeeks |
| 28 | Median in Row-wise Sorted Matrix | Find median in row-wise sorted matrix | GeeksforGeeks |
| 29 | Maximum Size Square Sub-matrix | Find maximum size square sub-matrix with all 1s | GeeksforGeeks |
| 30 | Matrix Chain Multiplication | Optimal matrix chain multiplication | GeeksforGeeks |
| 31 | Number of Islands | Count number of islands in binary matrix | GeeksforGeeks |
| 32 | Longest Common Subsequence | Find LCS of two sequences | GeeksforGeeks |
| 33 | Longest Increasing Subsequence | Find longest increasing subsequence | GeeksforGeeks |
| 34 | Edit Distance | Calculate minimum edit distance | GeeksforGeeks |
| 35 | 0-1 Knapsack Problem | Solve 0-1 knapsack problem | GeeksforGeeks |
| 36 | Fast Exponentiation | Implement fast exponentiation | GeeksforGeeks |
| 37 | Modular Multiplicative Inverse | Find modular multiplicative inverse | GeeksforGeeks |
| 38 | Maximum Path Sum in Triangle | Find maximum path sum in triangle | GeeksforGeeks |
| 39 | Egg Dropping Problem | Solve egg dropping problem | GeeksforGeeks |
| 40 | Coin Change Problem | Count ways to make change | GeeksforGeeks |
| 41 | Subset Sum Problem | Check for subset with given sum | GeeksforGeeks |
| 42 | Partition Problem | Check if array can be partitioned | GeeksforGeeks |
| 43 | Word Break Problem | Check if word can be segmented | GeeksforGeeks |
| 44 | Longest Palindromic Subsequence | Find longest palindromic subsequence | GeeksforGeeks |
| 45 | Optimal Binary Search Tree | Construct optimal BST | GeeksforGeeks |
| 46 | Rod Cutting Problem | Solve rod cutting problem | GeeksforGeeks |
| 47 | Longest Bitonic Subsequence | Find longest bitonic subsequence | GeeksforGeeks |
| 48 | Box Stacking Problem | Solve box stacking problem | GeeksforGeeks |
| 49 | Weighted Job Scheduling | Solve weighted job scheduling | GeeksforGeeks |
| 50 | Traveling Salesman Problem | Solve TSP using dynamic programming | GeeksforGeeks |
Related Resources
Related Algorithm Resources