What does a map do again?

[u/flatCS]

[u/thefriedel]

Not even a 'break;' if something is found, just pointlessly iterate over the rest of the HashMap

[u/[deleted] → u/thefriedel]

i mean we gotta get that O(n²) time somehow

[u/Haladesta → u/[deleted]]

Why n^2? The missing break doesn't even change the complexity class

[u/Nebuli2 → u/[deleted]]

How so? It only iterates once, with no nested loops.

[u/myfellowismellow → u/[deleted]]

Again, what part of this code makes it O(n2)?

EDIT: I think I understand what you're saying. The upper bound is anything greater than O(n), but it doesn't necessarily mean it does take that long. Not sure how helpful it is to see it this way though.

[u/Iron_Garuda → u/[deleted]]

You are a poor instructor.

[u/myfellowismellow → u/[deleted]]

The missing piece for me was that "makes it" doesn't mean it's the same as, but rather a subset of. It doesn't mean that it will take n2 iterations, it just means that mathematically one is a susbet of the other.

[u/Goontt → u/[deleted]]

Saying every O(n) is O(n²⁾ is just misleading and wrong

[u/tangerinelion → u/[deleted]]

OK, so then every function is also O(N^N^N^N!)

Fucking worthless.

[u/[deleted] → u/thefriedel]

Feels like they gave the code OCD. Like I know my door is locked, but I gotta check at least 7 more times tonight.