What is Algorithms

Why We Need to Learn Algorithms

Measuring Algorithms Performance

Unit of Measurement

Visualizing Big-O

Calculating Time Complexcity

O(1)

O(n)

O(n2)

What Cause Big-O to Increase?

[Introduction] Sorting Algorithms

2:27

Categories of Sorting and Well-Know Sorting Algorithms

3:07

Bubble Sort

[Code] Bubble Sort

[Analysis] Bubble Sort

2:33

Selection Sort

2:37

[Code] Selection Sort

3:18

[Analysis] Selection Sort

1:14

Insertion Sort

3:15

[Code] Insertion Sort

1:39

[Analysis] Insertion Sort

1:32

Counting Sort

7:14

[Code] Counting Sort

3:37

[Analysis] Counting Sort

2:30

Comparing Sorting Algorithms

1:29

[Article] Selecting Algorithm

[Introduction] Searching Algorithms

0:40

Linear Search

1:35

[Code] Linear Search

1:36

[Analysis] Linear Search

0:56

Binary Search

5:14

[Code] Binary Search

2:11

[Analysis] Binary Search

1:30

Comparing Searching Algorithms

0:40

[Article] Searching Algorithms

Recursive Function

1:06

Thinking in Recursive

3:16

Fibonacci Number

2:32

[Code] Fibonacci Number

0:54

[Analysis] Fibonacci Number

1:29

Quick Sort

3:14

[Code] Quick Sort

2:30

[Analysis] Quick Sort

1:35

Tower of Hanoi

3:48

[Code] Tower of Hanoi

1:56

[Analysis] Tower of Hanoi

0:54

Divide and Conquer Algorithms

1:03

Merge Sort

3:23

[Code] Merge Sort

2:20

[Analysis] Merge Sort

1:38

Counting Inversion

1:51

[Code] Counting Inversion

0:50

[Analysis] Counting Inversion

0:27

Counting Inversion (Algorithm Method)

3:17

[Code] Counting Inversion (Algorithm Method)

2:14

[Analysis] Counting Inversion (Algorithm Method)

1:02

Backtracking Algorithm

1:25

Depth First Search (DFS)

4:10

[Code] Depth First Search (DFS)

3:05

[Analysis] DFS Code

0:47

Breadth First Search (BFS)

1:33

[Code] Breadth First Search (BFS)

1:15

[Analysis] BFS Code

0:43

Subset Sum

3:52

[Code] Subset Sum

2:04

N-Queens Problem

4:21

[Code] N-Queens Problem

1:55

Dynamic Programming

2:21

Fibonacci using DP

2:03

[Code] Fibonacci DP (Top Down)

1:40

Fibonancial DP (Top Down)

0:32

Bottom-up

0:59

[Code] Bottom-up

0:47

0/1 Knapsack

6:04

[Code] 0/1 Knapsack

1:32

[Analysis] 0/1 Knapsack

0:31

Longest Common Subsequence (LCS)

4:49

[Code] LCS

1:28

[Analysis] LCS

0:24

Greedy Algorithms

0:39

ATM Problem

4:13

[Code] Greedy Algorithms

1:37

[Analysis] Greedy Algorithms

1:19

Activity Selection

2:13

[Code] Activity Selection

2:56

[Analysis] Activity Selection

0:22

Graph Algorithm

3:35

Hamiltonian Cycle

4:58

[Code] Hamiltonian Cycle

2:40

[Analysis] Hamiltonian Cycle

0:36

Shortest Path Algorithms

1:02

Floyd-Warshall Algorithm

4:28

[Code] Floyd-Warshall Algorithm

1:43

[Analysis] Floyd-Warshall Algorithm

0:57

Dijkstra’s Algorithm

6:01

[Code] Dijkstra’s Algorithm

2:42

[Analysis] Dijkstra’s Algorithm

0:49

[Article] Graph algorithm

Summary

1:15