teaching

Materials for full term courses, short courses and tutorials that I've taught or created.


University of Colorado Boulder

Below is a sample lecture notes from one my lectures as a Graduate Part-Time Instructor. In this lecture I continue with Quicksort and its modifications (introduced in the previous lecture) to undergraduates students. We end the lecture by working through a proof that shows Randomized Quicksort algorithm always leads to \(O(nlog_e n)\) runtime, where \(n \in \mathbb{N}\) is the size of the array/list


If you need more such lecture notes on concepts in Algorithms, feel free to email me!


YouTube

In my free time I seek to create educational content on YouTube. Below is my first video on “Dijkstra’s Shortest Path Algorithm”. Using Manim, an animation engine developed by Grant Sanderson of 3Blue1Brown, I seek to make beautiful and clear visualizations of concepts in algorithms.

I plan on creating more such content in the future.


  • (upcoming… A Comphrensive Guide for Algorithms)