5
(2 ratings)
You certainly acquired some basics when it comes to being able to think in terms of algorithms. That's good, because with this course you can further expand what you already know. While in the Level 1 course we focused on a general explanation of algorithmic thinking, in this course we will go into specifics. You will work with sorting algorithms, which are one of the most important foundations of computer science in the broad sense.
“Without sorting algorithms, we wouldn't have databases or search engines or any other complex applications.”
Tomasz - Algorithms Curriculum Manager
You will understand the data sorting problem.
You will get introduced to algorithms such as bubble sort and sort by insertion.
You will learn the algorithms like sorting by counting or the gnome sort.
You will master sorting by selecting and shaking.
You will learn what is stupid sorting (that's what it's called!) and sorting by sleeping.
You will understand what are the advantages and disadvantages of each algorithm.
In this course you will find coverage of as many as 11 popular sorting algorithms. As usual, in each step you will have to solve numerous tasks that will verify your newly acquired knowledge. Simple, neat theory and practical exercises - it really works. Examples of algorithm implementation are based on Python language but the knowledge is very universal and can be used in any language. What you will learn with this course is a foundation for life.
Without sorting algorithms, it would be hard to build any application that works with data. Thanks to them search engines, databases and any application that has to deliver structured data as an output can work. This is why we say that sorting algorithms are one of the foundations of computer science. A good understanding of the basics is therefore essential for anyone serious about a career as a programmer. Questions from this topic constantly come up during job interviews.
Average rating
5
(2 ratings)
John Kinneth
5.0
Dec 2, 2021
Finally I can understand what is up with sorting algorithms. You saved my GPA
Is this review helpful?
Finally I can understand what is up with sorting algorithms. You saved my GPA