Graph algorithms, breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components.
This is a great course by Holczer Balazs who is a simulation engineer at a multinational company with more than 94,000 students and 29 courses .…
This course is about advanced algorithms focusing on graph traversal, shortest path problems, spanning trees and maximum flow problems and a lots of its applications from Google Web Crawler to taking advantage of stock market arbitrage situations.
“Great course indeed!!! Complex concepts explained with such ease, especially to folks like me with many years since I finished my college.”
“This course is a really great introduction algorithms that are a bit more advanced than the standard Search/Sort stuff you see in other courses.”
“It’s a very good course and explained very well. The only reason I gave 4.5 stars is because of authors accent, it takes sometime to understand.”
Note: Some of these courses are free. But if you decide to purchase anything (using the links below) you’ll be financially supporting this publication. Thanks for your support.
Join our newsletter to receive news about Free Courses and educational content once a month …
About the reviewer
CourseProbe is an active reviewer, and a trainer on the topic of educational thinking and visual learning facilitation…
If you like this type of content, you could follow CourseProbe:
➡️ youtube
➡️ twitter
➡️ facebook
Please leave your comments below and share with your Facebook groupsif you think this might help some people …
Comments
Post a Comment