Taught by https://www.zuefle.org/awards-and-recognition
Merge Sort (a.k.a divide & conqure) ⬇️
https://en.m.wikipedia.org/wiki/File:Merge-sort-example-300px.gif
This course explored various algorithms and data structures.
Algorithms are sequences of computational steps that transform input into output, and
Data structures provide a structured format for managing data efficiently, enabling faster operations like searching, sorting, or updating, with a one-time commitment at the start.
The course emphasized understanding why certain algorithms work and why specific data structures were designed the way they are by tracing their evolution step by step from earlier versions.
The course was broadly divided into six parts: Sorting algorithms, Tree data structures, Hashing, Graph algorithms, various algorithmic paradigms, and Geometric algorithms.
