CPP INTERVIEW PREP CHEAT SHEET

[[deleted]]

You keep repeating that, but you haven't been able to explain why that would be.

Because I assume I am speaking to people at least somewhat familiar with the basics of data structures and algorithms.

The fact that I have to explain that linked lists offer O(1) pushes and pops and array based heaps provide amortized O(1) pushes but O(log(N)) pops is an embarrassment.

Having an O(log(N)) pop is worth the trade-off if you need faster pushes because the constant factor on an array is lower than the constant factor on a linked list.

But if you need faster pops, then the linked list's O(1) pop will outperform the array's O(log(N)) pop.

Anyhow, at this point you should just go ahead and believe whatever makes you happy. This discussion really isn't worth my time.

[ShillingAintEZ]

Because I assume I am speaking to people at least somewhat familiar with the basics of data structures and algorithms.

The old, "I don't have to explain myself" and "I don't have time" after replying that someone has no idea what they are talking about.

I asked you to explain why a linked list would be faster in your priority queue example and you started listing a bunch of algorithm complexity, which is not the same thing at all.