but sir can you elaborate please,how time complexity is different from number of comparisions(only in this case).
As far as i understand OMP:
we'll combine 10 and 15 sized lists to give 25 sized list,it will take 10+15 units of time
combine 25 and 40 sized lists to give 65 sized list. it will take 65 units of time.
combine 65 & 70 to give 135.it will take 135 units of time.
combine75 & 80 to give 155.it will take 155units of time.
at last combine 155&135 to give 290 sized list.it will take 290units of time.
this is something optimal,any other combination will take more time.So,in total 670units of time.
Now if I assume they are correct and it actually takes 290units of time,that means each list is contributing one element at every merge it is a 6 way merge(or n-way merge in general).
Can you please break the time taken in every merging of list please?
(This the most elaborately I can state my confusion).