Divide and Conquer

An algorithm practice

In its basic terminology, divide and conquer is a strategy which refers to the subdivision of a problem, and taking care of those problems step by step. Divide and conquer is a popular approach in large complex problem solving. The essence of Divide and conquer paradigm is to divide the data set through the mid section, and then run its operation depending on the requirements. So, without further ado let’s see which algorithms belong to this paradigm.

  • Binary Search
  • Finding Maximum, and Minimum
  • Merge Sort
  • Quick Sort
  • Selection Sort
  • Strassen’s matrix multiplication
  • Convex Hull

Author: ashiquechowdhury

A software developer, and a data science enthusiast

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s