0 0 votes in case of comparision sort max possible is n(n-1)/2 Algorithms sorting ace-test-series + – I_am_winner 913 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Shaik Masthan commented Nov 6, 2018 reply Follow flag given answer may be wrong... i am also getting ans is 6 0 0 replyShare Naveen Kumar 3 commented Nov 6, 2018 reply Follow flag bubble sort worst case will do 6 comparison 0 0 replyShare Please log in or register to add a comment.
0 0 votes answer is C. ceil[ log (4!) ] = 5 comparisons. (Take base 2) tech_beardo answered Aug 9, 2019 tech_beardo comment Share Follow 0 reply Please log in or register to add a comment.
