easy5 pts · first answer countssorting-and-searching

The three steps of divide and conquer

Which list describes the three steps of a divide-and-conquer algorithm such as merge sort?

A.Sort the input, scan it once, return the best itemB.Divide into subproblems, solve each recursively, combine the resultsC.Guess an answer, check it, adjust the guessD.Store every subproblem result in a table, then read it back

Discussion 0

Join free to post in the discussion.

The three steps of divide and conquer

Discussion 0

Related questions