Premium Support

Video Lectures Help Center

Having trouble viewing lectures? Try changing players. Your current player format is html5. Change to flash.

 I. INTRODUCTION (Week 1)

 II. ASYMPTOTIC ANALYSIS (Week 1)

 III. DIVIDE & CONQUER ALGORITHMS (Week 1)

 IV. THE MASTER METHOD (Week 2)

 V. QUICKSORT - ALGORITHM (Week 2)

 VI. QUICKSORT - ANALYSIS (Week 2)

 VII. PROBABILITY REVIEW (Weeks 2-3)

 VIII. LINEAR-TIME SELECTION (Week 3)

 IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)

 X. GRAPH SEARCH AND CONNECTIVITY (Week 4)

 XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)

 XII. HEAPS (Week 5)

 XIII. HASHING: THE BASICS (Week 5)

 XIV. HASHING: ADVANCED TOPICS (Week 6)

 XV. BLOOM FILTERS (Week 6)

 XVI. BALANCED BINARY SEARCH TREES (Week 6)

Loading Course Information...

Red-Black Trees (21 min)
Help Center Close Video Dialog Box