6 votes 6 votes Merge sort uses : Divide-and-conquer Backtracking Heuristic approach Greedy approach Algorithms nielit2017dec-assistanta algorithms sorting merge-sort divide-and-conquer + – admin asked Mar 31, 2020 • recategorized Aug 24, 2020 by Lakshman Bhaiya admin 1.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply haralk10 commented Apr 1, 2020 reply Follow Share Option A is correct 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves Mohit Kumar 6 answered May 20, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option A is correct. Merge sort uses divide and conquer approach . Sanandan answered Sep 9, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Marge Sort is Used Divide And Conquer Technique to Sort THe Number……………………… So , Option A is Correct Himanshu Kumar Gupta answered Sep 9, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option A) Merge Sort uses Divide and Conquer approach Sanandan answered Sep 12, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.