Language

Category

# 資料結構與演算法 (JavaScript)

## 用JavaScript學習資料結構與演算法，內容包含排序演算法、主定理、連結串列、雜湊表、二元搜尋樹、優先佇列、霍夫曼演算法、最小生成樹、深度優先搜尋、寬度優先搜尋、最短路徑演算法、戴克斯特拉演算法、動態規劃等等。

4.84 (25 reviews)

Students

Content

Last Update
Regular Price

## Topics

EXCLUSIVE SKILLSHARE OFFER
30-DAY FREE TRIAL

## Content

Introduction

Personal Website

JavaScript Help

JavaScript, Math Review

Code Runner

Prettier

Array Review

Object Review

Function Review

Class Review

Log Review

Complexity and Big O Notation

The Idea of Algorithm

Comparing Algorithms

Complexity

Analysis of fun 1 and fun 2

Big O Notation

Understanding Big O

Understand Big O Notation (Formal Definition)

Big Omega and Big Theta

Big O in Arrays and Objects

Introduction to Algorithm Design

Chapter Introduction

Linear Search

Binary Search

General Guide of Algorithm Design

Intersection Problem

Counter

Coding Practice - Frequency Problem

Coding Practice - Average Pair

Pointer

Coding Practice - Palindrome

Subsequence Problem

Sliding Window

Improved Maxsum

Coding Practice - Min Sub Array

Coding Practice - Unique Letter Substring

Coding Practice - Largest Product

Recursion

Coding Practice - Fibonacci Sequence

19 Coding Practice - Array of Arrays

Sorting Algorithms I

Intro to Sorting Algorithms

Bubble Sort

Understanding the Pseudo Code

Bubble Sort Code

Big O of Bubble Sort

Insertion Sort

Pseudocode for Insertion Sort

Implement Insertion Sort

Big O of Insertion Sort

Selection Sort

Implement Selection Sort

Big O of Selection Sort

Sorting Algorithms II

Intro to chapter 4

Merge Sort

Implementing Merge Sort

Big O of Merge Sort

Intro to Tree

Build Max Heap

BUILD-MAX-HEAP algorithm Quiz

Heap Sort Algorithm

Implementing Heap Sort

Overview of Heap Sort

(Challenging) Deeper Look of Build Max Heap

Quicksort and partition

Implementing Quick Sort

Overview of Quick Sort

Master Theorem, Lower bounds of Searching and Sorting

Lower bounds of searching

Lower bounds of Comparison Based Sorting Algorithm

Comparison Based Sorting

Heap Sort Deeper Look

Intro to Master Theorem

Master Theorem

Proof of Master Theorem

(Challenging) Linear Time Sorting

Data Structure I

Intro to Data Structure

Stack

Queue

Example and Deque

Hashtable Motivation

Hash Function

Division Method

Multiplication Method

(Challenging) Understanding Multiplication Method

Handing Collisions

Coding Hashtable I

Parsing string to integer

Coding Hashtable II

Understanding hashtable

Data Structure II: Tree

Intro to Tree

Graph Definition

Tree Definition

Tree Traversal

PreOrder

InOrder

PostOrder

Intro to BST

Constructing BST

Insertion Pseudocode of BST

Tree Insertion

Traversal

Searching in BST

Overview of BST

Intro to Priority Queue

Max Heap Insertion

Index Number

Enqueue

Dequeue

Encoding Theory

Compression with Simple Approach

Huffman Encoding

Huffman Encoding Codes

Intro to MST

Prim's Algorithm

Prim's Codes

Kruskal's Algorithms

Application of MST

Data Structure III - Graph

Intro to Graph Algorithms

Depth First Graph Traversal

Exercise

Pseudocode of DFT

Coding DFT

Coding BST

Intro to Floyd-Warshall

Floyd Warshall Algorithm

Intro to Dijkstra's Algorithm

Dijkstra's Algorithm by Hand

Dijkstra's Code

Udemy ID

## 2/2/2021

Course created date

## 4/23/2021

Course Indexed date
Bot
Course Submitted by