Ask
Login
1
123kviews
Write an algorithm to find minimum and maximum value using divide and conquer and also drive its complexity.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.1 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
6
6.8kviews
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k

Divide and Conquer (DAC) approach has three steps at each level of recursion:

  1. Divide the problem into number of smaller units called sub-problems.
  2. Conquer (Solve) the sub-problems recursively.
  3. Combine the solutions of all the sub-problems into a solution for the original problem.

Maximum and Minimum:

  1. Let us consider simple problem …

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.