28 28 votes Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach Algorithms gate1995 algorithms sorting easy algorithm-design-techniques merge-sort + – Kathleen 7.4k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 31 31 votes Answer: $A$One of the best examples of Divide and Conquer strategy.https://en.wikipedia.org/wiki/Merge_sort Gate Keeda answered Oct 8, 2014 • edited Nov 7, 2025 by Umesh Shelke Gate Keeda comment Share Follow See all 2 Comments 2 2 Comments reply suraj20041995 commented Jul 25, 2018 reply Follow flag Divide and conquer is option A 1 1 replyShare Kuljeet Shan commented Jun 3, 2019 reply Follow flag Typo ? correct it plz. 0 0 replyShare Please log in or register to add a comment.
3 3 votes Option A ---> Merge sort Merge sort is a divide and conquer algorithm. It works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. So Merge Sort first divides the array into equal halves and then combines them in a sorted manner. nitesh_scorpio answered Jan 4, 2019 nitesh_scorpio comment Share Follow 0 reply Please log in or register to add a comment.
