Introduction to Algorithms

I was recently searching for a good website for studying Algorithms. After going through various websites, I stumbled upon this educative.io course.

I was immediately hooked upon seeing the quality of the study material and that how easy it is for anyone to start learning. Course material are very visual with lots of explanations, pictures and demos.

It is divided into sub sections as follows -

• Intro to Algorithms

  • What is an algorithm and why should you care?
  • A Guessing Game
  • Route-finding

• Binary Search

  • Binary Search
  • Implementing Binary Search of an Array
  • Challenge: Binary Search
  • Running Time of Binary Search
  • Quiz: Running time of binary search

• Asymptotic Analysis

  • Introduction to Asymptotic notation
  • Big-θ (Big-Theta) notation
  • Functions in Asymptotic Notation
  • Big-O notation
  • Big-Ω (Big-Omega) notation
  • Quiz: Asymptotic notation

• Selection Sort

  • Sorting
  • Challenge: Implement Swap
  • Selection Sort Pseudocode
  • Challenge: Find minimum in Subarray
  • Challenge: Implement Selection Sort
  • Analysis of Selection Sort

• Insertion Sort

  • Insertion Sort
  • Challenge: Implement insert value before an index
  • Insertion Sort pseudocode
  • Challenge: Implement Insertion Sort
  • Analysis of Insertion Sort

• Recursion Algorithms

  • Recursion
  • The factorial function
  • Challenge: Iterative factorial
  • Recursive factorial
  • Challenge: Recursive factorial
  • Properties of recursive algorithms
  • Using recursion to determine whether a word is a palindrome
  • Challenge: is a string a palindrome?
  • Computing powers of a number
  • Challenge: Recursive Powers
  • The Sierpinksi gasket

• Towers of Hanoi

  • Towers of Hanoi
  • Move three disks in Towers of Hanoi
  • Towers of Hanoi, continued
  • Challenge: Solve Hanoi recursively

• Merge Sort

  • Divide and Conquer Algorithms
  • Overview of Merge Sort
  • Challenge: Implement Merge Sort
  • Linear-time Merging
  • Challenge: Implement Merge
  • Analysis of Merge Sort

• Quick Sort

  • Overview of Quicksort
  • Challenge: Implement Quicksort
  • Linear-time Partitioning
  • Challenge: Implement Partition
  • Analysis of Quicksort

• Graphs

  • Describing graphs
  • Representing graphs
  • Challenge: Store a graph

• Breadth-first Search

  • Breadth-first search and its uses
  • The breadth-first search algorithm
  • Challenge: Implement breadth-first search
  • Analysis of breadth-first search

Website - https://www.educative.io

And no, this post is not sponsored or anything. As I found it useful for myself and so I have shared. Pass it on and help others learn if you have too.