1 votes 1 votes Give a strategy to sort four distinct integers a, b, c, d in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of a, b, c, d. Others non-gate + – rsansiya111 asked Feb 20, 2022 reshown Feb 21, 2022 by rsansiya111 rsansiya111 440 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes @rsansiya111 It will be merge sort... a,b,c,d ... No of comparisons = ceil (log n! ) = ceil (log 24) = 5 ... 1. https://gateoverflow.in/48028/Isi2011-pcb-a-2a 22 answered Feb 20, 2022 22 comment Share Follow See all 0 reply Please log in or register to add a comment.