Ask HN: I'm a self-taught programmer, what am I likely missing

Re:Ask HN: I'm a self-taught programmer, what am I likely mi... by jonplackett on Tuesday October 05, 2021 @06:35PM (#28766600)

Any reading on this you'd recommend?

[ Parent | on HN ]

Re:Ask HN: I'm a self-taught programmer, what am I likely mi... by clash on Wednesday October 06, 2021 @03:06AM (#28770084)

I'll rephrase. Learn about the basic container data structures like linked list, vector, set, map, hash, tree, queue, heap.

Study time complexity of insertion, deletion, search, etc. in these data structures. Then you will understand when to use which. Big O notation is used to express time complexity for expected runtime of the operations.

[ Parent | on HN ]