Question discussion

Which of the following is NOT the application of Divide and Conquer?

3696Medium DSSSB TGT Computer Science 0 replies 2 views

ABinary Search
BAll Pairs Shortest Path Problem
CQuick Sort
DStrassen’s Matrix Multiplication

Correct answer: B

Explanation

Binary search, quick sort and Strassen’s matrix multiplication use divide and conquer. All-pairs shortest path (Floyd–Warshall) uses dynamic programming.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!