JavaScript Data Structure and Algorithm Crash Course

Course Curriculum

Chapter 1: Basic computing knowledge

Lecture 1: Bit and byte

Lecture 2: Encoding

Lecture 3: Memory address and byte addressing

Lecture 4: Bit width

Chapter 2: The big O notatin

Lecture 1: Big O notation

Chapter 3: Data structure

Lecture 1: Linear data structures

Lecture 2: Non-linear data structures

Lecture 3: Binary heap

Lecture 4: Create a binary heap in JavaScript

Chapter 4: Application of binary heap: the heap sorting algorithm

Lecture 1: Heap sort introduction

Lecture 2: Heap sort demo

Chapter 5: The bubble sorting algorithm

Lecture 1: Most and Least Frequent Word

Lecture 2: Bubble sorting intro

Lecture 3: Bubble sorting demo

Lecture 4: "Sort backwards"

Lecture 5: Bubble sort an array

Lecture 6: Improve the program efficiency

Lecture 7: The problem with the inner FOR loop

Lecture 8: Avoid unnecessary comparisons using the "rightSortBorder"

Lecture 9: LeftSortBorder: avoiding unnecessary comparisons while iterating backwards

Chapter 6: The advanced version of bubble sorting: the cocktail sorting algorithm

Lecture 1: Cocktail sorting basics

Lecture 2: Cocktail sorting improvements

Chapter 7: Quick, counting and insertion sort

Lecture 1: Quick sort intro

Lecture 2: Quick sort demo

Lecture 3: Counting sort introduction

Lecture 4: Deal with duplicated elements

Lecture 5: Improve efficiency Part 1

Lecture 6: Improve efficiency Part 2

Lecture 7: Insertion sort introduction

Lecture 8: Insertion sort demo

Chapter 8: Bucket and selection sorting

Lecture 1: Bucket sorting introduction

Lecture 2: Bucket sorting demo

Lecture 3: Selection sort introduction

Lecture 4: Selection sort demo