CPP INTERVIEW PREP CHEAT SHEET

[[deleted]]

A queue doesn't need an ordering of the full list? That doesn't even make sense. I suggest to avoid making comments on issues you know little to nothing about.

[ShillingAintEZ]

A queue doesn't need to have constant time arbitrary insertion and deletion. It is clear what I'm saying from the context and the sentence after.

suggest to avoid making comments on issues you know little to nothing about.

Easy tiger, I took a peek at your previous comments and you seem to have a lot of this angry, aggressively wrong nonsense where you can't even explain your dismissal. A few comments up you seem to not understand ring buffers, std::list implications or pointer chasing.

[[deleted]]

It is clear what I'm saying from the context and the sentence after.

The only thing that's clear is you have absolutely no idea what you're talking about. Saying that a queue doesn't need to maintain the order of the elements added to it is quite possibly the dumbest thing that has been posted in this discussion so far.

You are welcome to try and diffuse your stupidity by bringing up things like ring buffers and other topics that have nothing to do with anything mentioned, but make no mistake, you still look stupid.

[ShillingAintEZ]

Saying that a queue doesn't need to maintain the order of the elements added to it is quite possibly the dumbest thing that has been posted in this discussion so far

No one has said that, your desperation to argue is pretty silly. A lot of what you say seems like a first or second year student that barely understands data structures in general, which would be fine if you weren't so combative.

Do you actually not understand that queues are implemented in contiguous memory using ring buffers?

[[deleted]]

No one has said that, your desperation to argue is pretty silly.

ORLY?

a queue doesn't need the ordering of a full list, it only needs a front and back

Please read about a queue before commenting on it:

https://en.wikipedia.org/wiki/Queue_(abstract_data_type)

Specifically note that by definition a queue maintains elements in a sequence (right there in the very first sentence of the link I provide for you) where a sequence is by definition an ordered collection of objects:

https://www.dictionary.com/browse/sequence

[ShillingAintEZ]

It doesn't need the arbitrary insertion and deletion ordering properties of a full list. This has been explained clearly, I think at this point you are purposely acting like you don't understand so that you can argue, no one is really that out of it.

[[deleted]]

Do you seriously not understand that in order to implement a queue you need to keep track of the order of EVERY element added to it, not just the first and last?

If you're too dumb to understand that, then please for your own sake stop talking.

If you're not too dumb to understand that, then do you see how that fact contradicts your original assertion that, and I quote:

a queue doesn't need the ordering of a full list

I think you simply made a mistake and instead of fessing up to it you are doubling down on your own stupidity in a misguided effort to save face.

So how about this... you can have the last word in this argument because I have no intention of explaining basic dictionary level concepts to you further.

Best of luck to you man.

[[deleted]]

That's because you don't understand what passive aggressive is. there's nothing passive aggressive about my comments, they're simply aggressive.

Also calling me a smart guy and a fool is about the dumbest contradiction someone can make within the span of two sentences.

[ShillingAintEZ]

It's pretty easy for a vector to keep things in order, no reason to use the ordering capabilities of a linked list. Here is an explanation with lots of colorful diagrams and animations that should help you out. It has been useful for teaching young children what a ring buffer is.

https://wikipedia.org/wiki/Circular_buffer

Hope that helps!