Companion repo to a course on Udemy.com
Keeping track of my progress and resources I use learning data structures and practicing algos.
- Figure out the bare minimum pieces of information to represent your problem.
- Give reasonable defaults to the bare minimum pieces of info.
- Check the base case. Is there any work left to do? If not, return.
- Do some work. Call your function again, making sure the arguments have changed in some fashion.
- See notebook for notes and charts from the video lectures
- How to determine runtime complexity
- Some examples using reverse string algo and steps algo
- Big 'O' Notation
- Identifying runtime complexity
- Bonus: considering space complexity (amount of memory needed)