Herman Martinus
8.0/10
(Our Score)
Product is rated as #457 in category Python
This introduction to algorithms course is a comprehensive kick–start into the beautiful world of computer science. This course will prepare you for a great job in a technical field and is an essential stepping stone for delving deeper into data–structures and algorithms, and programming in general.
In this course we will take a look at what computational complexity is, and the importance thereof, followed by 4 of the basic sorting algorithms (bubble sort, insertion sort, merge sort and quick sort) by visualisation and demonstration in Python.
All the course content is simple to understand and relevant to real world application.
Instructor Details
Votes: 0
Courses : 1
Specification: An introduction to algorithms in Python
|
9 reviews for An introduction to algorithms in Python
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review
| Price | $12.99 |
|---|---|
| Provider | |
| Duration | 0.8 hours |
| Year | 2016 |
| Level | Beginner |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
An introduction to algorithms in Python
$12.99
Simon Kai Garvie –
Really well presented, course contains both visual and code based examples alongside good explanations making it easy to understand.
William Francis –
Clearly spoken and well illustrated. Covers the topic of sorting from a basic entry point all the way to industry use, with live code examples. Would recommend for anyone who would like to learn more about the inner workings of sorting algorithms.
Maksim Bronsky –
Well, he basically runs through standard implementations and enters them (quite erratically actually) into his editor. There is no further explanation as why the algorithm produces the result it does and it would have been nice to see some references towards the efficiency (big O notation) regarding his implementations except for just mention them
Herman James –
It may be because the instructor shares my name, it may because his content is great, it may be because he’s taught me more in the past 40 minutes than I learnt in an entire semester, but this is great. Thank you!
Kevin Shari –
Good information. Well paced.
Cailin Teman –
Very informative and useful! I would like to hear more about why the algorithms have that specific computational complexity. Apart from that I feel I have learnt a lot!
Jason Singer –
Great informative introduction to implementing sorting algorithms. Consider elaborating on how to calculate big O notation (complexity) and include the algorithm execution times to tie them together.
Proshenjit Majumder –
Awesome course on algorithm. I had no idea and a beginner’s programmer. Got a great insight on a very short time. Good short and sweet, to the point lectures. Love his way of explaining. Anyone new to algorithm can get benefit from this course. More materials would be a plus if he can add in future.
Swapneel Chhaya –
only two sections for algos in python?