28:21

mod11lec52

31:27

mod11lec53

26:01

mod11lec51

27:46

mod11lec54

25:50

mod11lec55

33:12

mod12lec60

31:51

mod12lec58

28:18

mod12lec59

26:24

mod12lec57

32:52

mod12lec56

29:38

mod06lec26

32:42

mod10lec50

28:14

mod10lec49

26:03

mod10lec48

28:06

mod10lec47

25:47

mod10lec46

34:12

Lecture 41

27:15

Lecture 45

27:41

Lecture 44

27:20

Lecture 43

28:07

Lecture 42

27:26

Lecture 40 : Graph Search

28:02

Lecture 39 : Prim's Algorithms

28:35

Lecture 38 : Graphs

27:47

Lecture 37 : Longest common subsequence

27:46

Lecture 36 : Dynamic Programming

26:32

mod07lec31

34:39

mod07lec32

31:18

mod07lec33

26:43

mod07lec34

26:53

mod07lec35

33:04

Lecture 26 : Randomly build BST

28:19

Lecture 27 : Red Black Tree

29:12

Lecture 28 : Red Black Tree (Contd.)

29:02

Lecture 29 : Augmentation of data structure

31:52

Lecture 30 : Interval trees

26:46

Lecture 25 : Binary Search Tree (BST) Sort

34:26

Lecture 24 : Perfect Hashing

28:47

Lecture 23 : Universal Hashing

29:11

Lecture 22 : Open Addressing

27:35

Lecture 21 : Hash Function

27:56

Lecture 20 : Worst case linear time order statistics

28:20

Lecture 19 : Randomised Order Statistics

27:23

Lecture 18 : Order Statistics

32:01

Lecture 17 : Radix Sort & Bucket Sort

27:09

Lecture 16 : Linear time Sorting

29:16

Lecture 15 : Decision Tree

30:07

Lecture 14 : Heap Sort

28:37

Lecture 13 : Heap

33:13

Lecture 12 : Randomized Quicksort

28:51

Lecture 11 : Analysis of Quicksort.

29:49

Lecture 10 : QuickSort

34:05

Lecture 9 : Straseen's Algorithms

27:41

Lecture 8 : Divide-and-Conquer (Contd.)

26:38

Lecture 7 : Divide-and-Conquer

29:29

Lecture 6 : The Master Method

27:32

Lecture 5 : Substitution Method

27:17

Lecture 4 : Recurrence of Merge Sort

26:44

Lecture 3 : Asymptotic Analysis

26:42

Lecture 2 : Analysis of Insertion Sort