Algorithms 101

Current Status

Not Enrolled

Price

$35.00 (3 month access)

Get Started

Take this Course

In this course, we will take a dive into the world of algorithms, and explain what they are, how to represent them in a form that is intuitive and easy to understand, and how to compare them according to their efficiency. We also explore several different types of Brute force algorithms, Greedy algorithms, and Binary search algorithms.

What you will learn?

  • What algorithms are.
  • How to represent algorithms using flowcharts.
  • How to compare algorithms according to their complexity.
  • Brute force algorithms.
  • Greedy algorithms.
  • The two pointers algorithm.
  • The binary search algorithm.

Algorithms-101-Attachments

Course Content

Session 1: Introduction
Flowcharts 2: Loops
Good and Bad Algorithms
Quantifying Good and Bad: Big O Notation
Writing Algorithms in C++ 1 Quiz
Brute Force: Introduction
Brute Force: Introduction
Brute Force Example 1
Brute Force Example 2
Brute Force Example 3
Where Brute Force doesn’t work 1 Quiz
Session 3: Greedy algorithms
Greedy Algorithms: Introduction
Greedy Example 1
Greedy Example 2
Greedy Example 3
Where Greedy doesn’t work 1 Quiz
Session 4: Two pointers
Two Pointers: Introduction
Two Pointers Example 1 (continued)
Two Pointers Example 2
Two Pointers Example 3
Where Two Pointers doesn’t work 1 Quiz
Session 5: Binary search
Binary Search: Introduction
Binary Search Example
Binary Search Example (continued)
Binary Search Example 2 1 Quiz