Directory
Search for:
동영상
Course: Algorithmic Toolbox. Click here to go back.
- Welcome!
- Solving the Sum of Two Digits Programming Challenge (screencast)
- Solving the Maximum Pairwise Product Programming Challenge: Improving the Naive Solution, Testing, Debugging
- Stress Test - Implementation
- Stress Test - Find the Test and Debug
- Stress Test - More Testing, Submit and Pass!
- Why Study Algorithms?
- Coming Up
- Problem Overview
- Naive Algorithm
- Efficient Algorithm
- Problem Overview and Naive Algorithm
- Efficient Algorithm
- Computing Runtimes
- Asymptotic Notation
- Big-O Notation
- Using Big-O
- Course Overview
- Largest Number
- Car Fueling
- Car Fueling - Implementation and Analysis
- Main Ingredients of Greedy Algorithms
- Celebration Party Problem
- Efficient Algorithm for Grouping Children
- Analysis and Implementation of the Efficient Algorithm
- Long Hike
- Fractional Knapsack - Implementation, Analysis and Optimization
- Review of Greedy Algorithms
- Intro
- Linear Search
- Binary Search
- Binary Search Runtime
- Problem Overview and Naïve Solution
- Naïve Divide and Conquer Algorithm
- Faster Divide and Conquer Algorithm
- What is the Master Theorem?
- Proof of the Master Theorem
- Problem Overview
- Selection Sort
- Merge Sort
- Lower Bound for Comparison Based Sorting
- Non-Comparison Based Sorting Algorithms
- Overview
- Algorithm
- Random Pivot
- Running Time Analysis (optional)
- Equal Elements
- Final Remarks
- Change Problem
- The Alignment Game
- Computing Edit Distance
- Reconstructing an Optimal Alignment
- Problem Overview
- Knapsack with Repetitions
- Knapsack without Repetitions
- Final Remarks
- Problem Overview
- Subproblems
- Algorithm
- Reconstructing a Solution