This is a video effort released by O’Reilly that strikes an interesting balance between theory and practicality. It touches more on the theory of algorithms than you’ll normally get if you just go looking to learn about how algorithms are implemented in a particular language, but it dwells more on implementation and language features than you’d typically get from a course intended to teach the theory of algorithms.
It’s definitely not intended for an audience who has no grasp of Python at all yet. If you’re a good general program, of course, you can probably tell what’s going on (especially since Python is a relatively readable language) but your time would probably still be better spent doing a quick run through how the language works so that you can focus on the algorithm and not the syntax. (O’Reilly has some excellent books and videos on the topic, of course, but you can also go to sites like Khan Academy, Codecademy, Coursera, and edX as well).
The videos themselves are basically a mix of watching the instructor work in IDLE, seeing the instructor himself, and seeing screens that look like PowerPoint slides.
My personal view is that the videos have a lot of value to offer, because they walk you carefully through some extremely key algorithms. Even if you don’t ever have to implement something like MergeSort personally (and you probably won’t), understanding how it’s implemented is good for your ability to understand how your own algorithms should work and how to write them cleanly.
I would recommend, of course, that you watch some of the sample video that O’Reilly Media has made available on the Working With Algorithms in Python product page. The videos are well done, but my experience has been that even good teachers don’t necessarily ‘click’ perfectly with every student. You might as well see how well you follow his train of thought before you hand over any money!