Algorithms by Sharma Thankachan

Lecture on the "Design and Analysis of Algorithms".

2.11 - Integer Sorting Algorithms | Counting Sort and Radix Sort
2.11 - Integer Sorting Algorithms | Counting Sort and Radix Sort
2.8 - Probability Basics | Randomized Algorithms | Hiring Problem | Coupons Collector
2.8 - Probability Basics | Randomized Algorithms | Hiring Problem | Coupons Collector
2.10 - Quick Select | Randomized Algorithms
2.10 - Quick Select | Randomized Algorithms
2.9 - Quick Sort | Randomized Algorithms (Monte Carlo vs Las Vegas)
2.9 - Quick Sort | Randomized Algorithms (Monte Carlo vs Las Vegas)
2.7 - Finding the MIN/MAX slope (of lines connecting points in 2D) and its Counting Version
2.7 - Finding the MIN/MAX slope (of lines connecting points in 2D) and its Counting Version
2.6 - Counting Inversions in an Array in O(n log n) time via Divide and Conquer
2.6 - Counting Inversions in an Array in O(n log n) time via Divide and Conquer
2.5 - Closest Pair of Points using Divide and Conquer algorithm in O(n log n) time.
2.5 - Closest Pair of Points using Divide and Conquer algorithm in O(n log n) time.
2.4 - Integer Multiplication (Karatsuba's Algo) & Matrix Multiplication (Strassen's Algo)
2.4 - Integer Multiplication (Karatsuba's Algo) & Matrix Multiplication (Strassen's Algo)
2.3 - Binary search (in 1D and 2D arrays - upper and lower bounds) and Bitonic search
2.3 - Binary search (in 1D and 2D arrays - upper and lower bounds) and Bitonic search
2.2 - Linear Time Selection (Median of Medians Algorithm)
2.2 - Linear Time Selection (Median of Medians Algorithm)
2.1 - Lower Bound for (Comparison Based) Sorting
2.1 - Lower Bound for (Comparison Based) Sorting
2.0 - Sorting Algorithms (Selection, Insertion and Merge Sort) with Analysis
2.0 - Sorting Algorithms (Selection, Insertion and Merge Sort) with Analysis
1.5 - Growth of Functions and Asymptotic Notations
1.5 - Growth of Functions and Asymptotic Notations
1.4 - Warm-up problem (Maximize your the amount of your drink + Harmonic Series)
1.4 - Warm-up problem (Maximize your the amount of your drink + Harmonic Series)
1.3 - Warm-up Problem (Separate HEAVY and LIGHT coins)
1.3 - Warm-up Problem (Separate HEAVY and LIGHT coins)
1.2 - Warm-up problem (Find the Max and the Second Max)
1.2 - Warm-up problem (Find the Max and the Second Max)
1.1 - Warm-up problem (Find the Min and the Max)
1.1 - Warm-up problem (Find the Min and the Max)
1.0 - Introduction
1.0 - Introduction