I really want to become an advanced developer… so I was doing it like a bad guy…
What I really feel like I can’t do alone right now is merge sort. As for recursion, it’s all messed up now and I’ve reached a point where I don’t know where to start fixing it, so I’ve given up.
================================================================
================================================================
When studying data structure algorithms, the solution to the problem is of course implemented to the end, whether it works or not.
If the conceptual problem is a data structure, should I implement the data structure directly without using a library, and should I implement the algorithm myself by only looking at the theory?
Or can I just look at the implementation of the pseudocode library and memorize it until I understand and follow along with comments?
Noel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.