A guide to create efficient algorithms from scratch

In this course we are going to talk about the basic data structures, algorithms and numerical methods. There will be an introductory video for every topic about the theoretical background then we will implement the problems together. It is advisable to have some intermediate knowledge about numerical methods, as we are not going to discuss the theoretical background in depth.

The first section will be about basic data structures such as linked lists, stack and queues and so on.

The second chapter is about graph algorithms. We will talk about shortest path algorithms, graph traversing, and spanning trees.

The last section is about numerical methods such as integration or solving differential equations. Although I am sure you will never have to implement such methods from scratch, it is good to be familiar with such low-level stuffs.