Thanks for your kind comment! I do not have any systematic leaning of computer science; I often feel confused when reading textbooks on algorithms hahaha.

Should I be familiar with every step of Dijkstra’s search algorithm and remember the pseudocode at all times? Why don’t the textbooks explain why the algorithm is correct?

▲

monadgonad 12 hours ago | parent | next [-]

> Should I be familiar with every step of Dijkstra’s search algorithm and remember the pseudocode at all times?

Somehow, I think you already know the answer to that is "no".

I've been working as a software engineer for over 8 years, with no computer science education. I don't know what Dijkstra's search algorithm is, let alone have memorised the pseudocode. I flicked through a book of data structures and algorithms once, but that was after I got my first software job. Unless you're only aiming for Google etc, you don't really need any of this.

	▲	chopin 9 hours ago \| parent [-]
		You should know the trade-offs of different algorithms, though. Many libraries let you choose the implementation for a spcific problem. For instance tree vs. hash map where you trade memory for speed.

▲

minitech 16 hours ago | parent | prev [-]

> Why don’t the textbooks explain why the algorithm is correct?

The good ones do!

> Should I be familiar with every step of Dijkstra’s search algorithm and remember the pseudocode at all times?

If it’s the kind of thing you care to be familiar with, then being able to rederive every step of the usual-suspect algorithms is well within reach, yes. You don’t need to remember things in terms of pseudocode as such, more just broad concepts.