Table of Contents Edit this course

• Chapter 1. Intro To Algorithm Analysis (~50 Minutes)

  Concepts:
  • 1. What is Algorithm Analysis? (~10 Minutes)
  • 2. The Problem of Sorting (~7 Minutes)
  • 3. Insertion Sort Performance and Worst Case Analysis (~5 Minutes)
  • 4. Average Time Analysis and Best Case (~6 Minutes)
  • 5. Asymptotic Analysis (~7 Minutes)
  • 6. Algorithms and Asymptotic Notation (~4 Minutes)
  • 7. Final Analysis of Insertion Sort (~7 Minutes)

• Chapter 2. Algorithms' Mathematics, Solving Recurrences and Merge Sort (~36 Minutes)

  Concepts:
  • 1. Merge Sort - Pseudocode (~5 Minutes)
  • 2. Recurrences (~6 Minutes)
  • 3. Recursion Trees (~7 Minutes)
  • 4. Big-O Notation - Rigorous Definition (~7 Minutes)
  • 5. Big O, Big Omega, and Big Theta Notation - Rigorous Definitions (~7 Minutes)

• Chapter 3. Sorting (~40 Minutes)

  Concepts:
  • 1. Bubble Sort (~3 Minutes)
  • 2. Bubble Sort Analysis And Proofs By Induction (~7 Minutes)
  • 3. Selection Sort (~4 Minutes)
  • 4. Linear and Binary Search (~7 Minutes)
  • 5. Quick Sort (~5 Minutes)
  • 6. Quick Sort Analysis (~12 Minutes)

• Chapter 4. Divide And Conquer Paradigm (~30 Minutes)

  Concepts:
  • 1. Divide And Conquer - Merge Sort Revisited (~7 Minutes)
  • 2. Binary Search (~4 Minutes)
  • 3. Powering a Number (~5 Minutes)
  • 4. Fibonacci (~5 Minutes)
  • 5. Fibonacci - Bottom up (~7 Minutes)

• Chapter 5. Hashing (~41 Minutes)

  Concepts:
  • 1. Symbol-table Problem (~7 Minutes)
  • 2. Hashing (~4 Minutes)
  • 3. Resolving Collisions By Chaining (~4 Minutes)
  • 4. Analysis of Hashing via Chaining (~6 Minutes)
  • 5. Analysis - Average Case (~6 Minutes)
  • 6. Hash Function Choice and Division Method (~6 Minutes)
  • 7. Hash Function Choice and Division Method - Good Heuristics (~5 Minutes)

About the Curator

Vesc

Vesc is a Software Engineer with great deal of industry experience. Vesc also has an awesome theoretical background in Computer Science, graduating with a Masters of Science in Computer Science degree from one of the top computer science programs in the world - the Computer Science department of Stanford University. While at Stanford Vesc was a co-author of two published papers in the computer science journals, and has been a presenter of his research at conferences. His thesis explored the creation and theory behind file systems optimized for content sharing and creation. Vesc has always been fascinated by algorithms and the mathematics that help us solve complex computer science problems and analyze the performance of our solutions.