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.
0 votes 0 votes It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.. Option A is correct heisenberggg answered Apr 6, 2021 heisenberggg comment Share Follow See all 0 reply Please log in or register to add a comment.