0 votes 0 votes suppose Merge sort algorithm takes 2 sec to sort a set of 64 keys then how much time will it take to sort a set of 512 keys ?? PrPrashantkumar asked Aug 12, 2018 PrPrashantkumar 871 views answer comment Share Follow See 1 comment See all 1 1 comment reply MiNiPanda commented Aug 12, 2018 reply Follow Share Merge sort time complexity is O(nlogn) Time taken to sort 64 keys is 2 sec. So, c*nlogn=2 where c is a constant and n=64. c= 2/(64log64) = 2/(64*6) To sort 512 items it will require c*512log512 = 2/(64*6) * 512 * 9 = 24 secs. 3 votes 3 votes Please log in or register to add a comment.