Ask
Login
0
4.9kviews
Write in brief about divide and conquer strategy.
written 7.9 years ago by gravatar for satishmanje93 satishmanje93 • 250 modified 3.9 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k

Subject: Analysis Of Algorithm

Topic: Divide Aqnd Conquer

Difficulty: Medium
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
62views
written 7.7 years ago by gravatar for satishmanje93 satishmanje93 • 250

Like Greedy and Dynamic Programming, Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three steps.

  1. Divide: Break the given problem into subproblems of same type.

  2. Conquer: Recursively solve these subproblems

  3. Combine: Appropriately combine the answers

enter image description here

Following are some standard algorithms …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.