1 votes 1 votes Find the odd one out Merge Sort TVSP Problem Knapsack Problem OBST Problem Algorithms nielit2016dec-scientistb-it algorithms easy dynamic-programming divide-and-conquer + – admin asked Mar 31, 2020 • retagged Jan 10 by Hira Thakur admin 3.2k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply abhishek tiwary commented Apr 28, 2020 reply Follow Share (A) merge short 0 votes 0 votes HiteshVaish commented Jun 26, 2020 reply Follow Share Merge sort 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Option A Merge Sort – Divide and Conquer Travelling Salesman Problem – Dynamic Programming Knapsack Problem – Dynamic Programming Optimal Binary Search Tree Problem – Dynamic Programming Mohit Kumar 6 answered May 27, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Marge Sort are Divide And Conquer method and the remaining are Dynamic programing approch. Option A is Correct Himanshu Kumar Gupta answered Sep 8, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes option A )Merge Sort – Divide and Conquer approach , and all the rest are based on DP. Sanandan answered Sep 11, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes A – Megre Sort Preet_0010 answered Jul 29, 2021 Preet_0010 comment Share Follow See all 0 reply Please log in or register to add a comment.