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.
A brief look at computational complexity and Big O notation. With this you will be able to categorize algorithms by their runtime efficiency.
A quick quiz on the student's understanding of algorithm efficiency and Big O.
An extensive look at the bubble sort algorithm including a visualisation and a code explanation.
An extensive look at the insertion sort algorithm including a visualisation and a code explanation.
An extensive look at the merge sort algorithm including a visualisation and a code explanation.
An extensive look at the quick sort algorithm including a visualisation and a code explanation.
A brief quiz on the 4 basic sorting algorithms covered.
Herman Martinus is a top game developer and interaction designer. He escaped the city of Johannesburg for the greener pastures of Cape Town, where you'll find him hiking, surfing, longboarding or otherwise outdoors whenever he's not at his computer. After working in eCommerce, Herman found his passion in interactive experiences and went on to build games ranging from board games and 2D mobile games to VR training simulators for commercial pilots. His enthusiasm for creating incredible experiences drives him to excel in development and design.