Computer Science, asked by Pankajpundir3194, 10 months ago

Suppose there are 4 stored lists of n/4 elements each. If we merge these lists into a single sorted list of n element, how many key comparisons in the worst case using an efficient algorithm?

Answers

Answered by subbaprerna93
0

Answer:

But what are lists???☆☆☆☆☆

Similar questions
Math, 5 months ago