10. What You Will Learn & How to Get Help
211.2.6. Quasilinear Runtime
20.1. Benefits of learning about algorithms and data structures
221.2.7. Polynomial Runtimes
30.2. Course Structure
231.2.8. Exponential Runtimes
41. Introduction to Algorithms
241.2.9. How to Determine the Complexity of an Algorithm
51.1. Playing a Counting Game
251.2.10. Practice Exercise 3
61.1.1. What is an Algorithm?
261.2.11. Answers to Practice Exercise 3
71.1.2. Guess the Number Game
271.3. Algorithms in Code
81.1.3. Algorithm Guidelines
281.3.1. Linear Search in Code
91.1.4. Practice Exercise 1
291.3.2. Binary Search in Code
101.1.5. Answers to Practice Exercise 1
301.3.3. Recursive Binary Search in Code
111.1.6. Evaluating Linear Search
311.3.4. Practice Exercise 4
121.1.7. Evaluating Binary Search
321.3.5. Answers to Practice Exercise 4
131.1.8. Practice Exercise 2
331.4. Recursion and Space Complexity
141.1.9. Answers to Practice Exercise 2
341.4.1. Recursive Functions
151.2. Time Complexity
351.4.2. Space Complexity
161.2.1. Efficiency of an Algorithm
361.4.3. A Recap of What You Learned
171.2.2. The Big O
371.4.4. Practice Exercise 5
181.2.3. Constant and Logarithmic Time
381.4.5. Answers to Practice Exercise 5
191.2.4. Linear & Quadratic Time
391.5. Download Training Resources & Get Further Help
201.2.5. Cubic Runtime