Talk:2483: Linked List Interview Problem

Explain xkcd: It's 'cause you're dumb.

Revision as of 03:15, 1 July 2021 by 108.162.221.84 (talk) (Explain O notation)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

Assuming not everyone understands O notation: O(1) means that it always takes the same time, no matter how much data is stored. O(n) means the time is proportional to the amount of data stored - if you have 10 times the data, it takes 10 times as long to find the one you want.

Retrieved from "https://www.explainxkcd.com/wiki/index.php?title=Talk:2483:_Linked_List_Interview_Problem&oldid=214468"