Hi Students

This is hand made notes of Divide & Conquer in ALGORITHM

Content:

• Recursion
  
• Applications
  
• Power of an Element
  
• Binary Search
  
• Merge Sort
  
• Quick Sort
  
• Selection Procedure
  
• Strassen's Matrix Multiplication
  
• Heap Sort
  
• Insertion
  
• Bubble Sort
  
• Selection Sort
  
• Counting Sort
  
• Bucket Sort
  
• Radix Sort
  

         (with Examples)

NOTE: If this helpful for you then don't forget to post some more stuff here.

Thanks
Dipesh