From the course: Python Data Structures and Algorithms

Parting comments and what comes next - Python Tutorial

From the course: Python Data Structures and Algorithms

Start my 1-month free trial

Parting comments and what comes next

“

- [Robin] We've come to the end of this course on data structures and algorithms in Python. We've covered a lot of material. I hope you have found it is interesting to follow as I did to make it. I want to make a few parting comments. There are many different flavors of the algorithms we have covered, and it's easy to get overwhelmed if you look at lots of different articles and videos on the internet to supplement your learning. I suggest sticking with the versions in this course until you are very confident with how they work. Once you have this foundation, it will be easier to keep your bearings when you come across alternative versions. And you'll also be able to recognize the ways in which apparently different implementations are in fact very similar in essence. I also want to remind you that we've used a special case of a graph in this course, that is a graph represented as a 2D list of a row, column coordinates. Many of the versions you will see of the algorithms we have covered will refer to more general graphs. Having studied the algorithms in the way we have here will put you in an excellent position to understand more general cases of pathfinding within a graph. What comes next depends on your goals. You may wish to take an academic approach and look in more detail at graphs and graph algorithms, for example. You may also wish to look into algorithmic efficiency in terms of both time and memory, a topic we have only mentioned in passing in this course. You may also be inspired to use some of the ideas from the provided GUI code, combined with your own new understanding of algorithms and data structures in your own games and more serious projects. Whatever you do next, I wish you all the best. Thank you for taking this course.

Contents