DS and Algorithms (GATE 2014 set 2 QUESTION 5)

preview_player
Показать описание
Suppose P , Q , R , S , T , are sorted sequences having lengths 20 , 24 , 30 ,35 , 50 respectively . They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ?
#Gatecs2014QNA #Datastructure #Algorithms #Appliedcourse #gatecse #Computerscience
Рекомендации по теме