[Solved] How to design a data structure which supports the following operations in constant time?

by

[ad_1]

Suppose such a data structure existed.

Then here is an O(n) comparison-based sorting algorithm:

  1. Push() every item into this data structure.
  2. Pop() them all off in sorted order.

No O(n) comparison-based sorting algorithm can exist, therefore no such data structure can exist.

[ad_2]

solved How to design a data structure which supports the following operations in constant time?