GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - blackdogcode/ALGORISMUS: Algorithms Specialization - Stanford

BranchesTags
Open more actions menu

Latest commit

 

History

330 Commits
330 Commits

Folders and files

NameName
Last commit message
Last commit date
06_Brute_Force_Search
06_Brute_Force_Search
 
 
07_Divide_and_Conquer
07_Divide_and_Conquer
 
 
09_Dynamic_Programming/JUMPGAME
09_Dynamic_Programming/JUMPGAME
 
 
10_Greedy_Method/회의실배정/회의실배정
10_Greedy_Method/회의실배정/회의실배정
 
 
11_Combinatorial_Search/baby_gin_game
11_Combinatorial_Search/baby_gin_game
 
 
18_Linear_Data_Structure/JOSEPHUS
18_Linear_Data_Structure/JOSEPHUS
 
 
19_Queue_Stack_Dequeue/stack
19_Queue_Stack_Dequeue/stack
 
 
20_String
20_String
 
 
21_Tree
21_Tree
 
 
22_Binary_Search_Tree
22_Binary_Search_Tree
 
 
23_Priority_Queue/RUNNINGMEDIAN
23_Priority_Queue/RUNNINGMEDIAN
 
 
24_Segment_Tree/MORDOR/MORDOR
24_Segment_Tree/MORDOR/MORDOR
 
 
25_Disjoint_Set
25_Disjoint_Set
 
 
26_Trie/SOLONG/SOLONG
26_Trie/SOLONG/SOLONG
 
 
28_DFS
28_DFS
 
 
29_BFS
29_BFS
 
 
30_Shortest_Path_Problem
30_Shortest_Path_Problem
 
 
31_Minimum_Spanning_Tree/1197_최소_스패닝_트리
31_Minimum_Spanning_Tree/1197_최소_스패닝_트리
 
 
Baekjoon/15874_CaesarCipher
Baekjoon/15874_CaesarCipher
 
 
DataStructures
DataStructures
 
 
Others/PROJECT_1
Others/PROJECT_1
 
 
Reference
Reference
 
 
Sorting
Sorting
 
 
Stanford_Algorithm_Assignment
Stanford_Algorithm_Assignment
 
 
Stanford_Algorithm_Lecture
Stanford_Algorithm_Lecture
 
 
.gitignore
.gitignore
 
 
Algorithms_Illuminated_Part1.pdf
Algorithms_Illuminated_Part1.pdf
 
 
Algorithms_Illuminated_Part2.pdf
Algorithms_Illuminated_Part2.pdf
 
 
Algorithms_Illuminated_Part3.pdf
Algorithms_Illuminated_Part3.pdf
 
 
Computer_Science_Mathmatics_Princeton.pdf
Computer_Science_Mathmatics_Princeton.pdf
 
 
README.md
README.md
 
 

Repository files navigation

Mathmatics for Computer Science

Computer_Science_Mathmatics_Princeton.pdf
Andrew's Algorithm Exercise Solutions

Competitive Algorithm Sites

Google Code Jam, Algo Spot, Backjoon, Geeks for Geeks, Top Coder, Projec Euler

Analysis of Algorithm and Master Method

Analysis of Algorithms | Set 1 (Asymptotic Analysis)
Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
Analysis of Algorithms | Set 3 (Asymptotic Notations)
Analysis of Algorithms | Set 4 (Analysis of Loops)
Analysis of Algorithm | Set 4 (Solving Recurrences RSP(rate of subproblem proliferation) and RWS(rate of work shrinkage)

Master Method

Recurrence Master Method Analysis

Analysis of Algorithm | Set 5 (Amortized Analysis Introduction)

Amortized Analysis


Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Karatsuba algorithm - Wiki, C++ Implemntation
Strassen’s Matrix Multiplication - Geeks, Online Judge
Easy way to remember Strassen’s Matrix Equation - Geeks

Strassen Mutlpication Formula


Inversion Count - Geeks, C++ Implementation

Inversion Count Explain Graph


Closest pair of points - Wiki, Closest Pair of Points - Geeks, Online Judge

Close Point


Quick Sort - Wiki, Quick Sort - Geeks. QuickSort using Random Pivoting

Continuous and discrete probability distributions

Linearlity of Expectation

expectation_probability_Pivot

Probabilty based on quicksort partition - 0 < a < 0.5
Birthday problem among k people
Why is the expected value E(X2)≠E(X)2?

Order statistic, Median of medians, Quick Select

Reduce to Sorting

Randomized Selection


[Karger's algorithm]
Karger's algorithm - wiki
Karger’s algorithm for Minimum Cut | Set 1 (Introduction and Implementation)
Karger’s algorithm for Minimum Cut | Set 2 (Analysis and Applications)
Find minimum s-t cut in a flow network

Min-Cut

Graph Search, Shortest Paths, and Data Structures

BFS - Wiki, BFS - Geeks, Online Judge

DFS - Wiki, DFS - Geeks, Online Judge

Topological Sorting - Wiki, Topological Sorting - Geeks, Online Judge

SCC - strongly connected components, Tarjan’s Algorithm to find Strongly Connected Components

Dijkstra's algorithm - wiki, Geeks for Geeks, Implementation


Heap and Blanced Binary Search Tree

Heap Sort - wiki, Heap Sorting - Geeks

Self-balancing binary search tree, Convert a normal BST to Balanced BST

Splay Tree

splay_tree_zigzag

AVL Tree

AVL-tree-wBalance_K

Red-Black Tree

Red-Black Tree Example

Red-Black Tree 4 Invaraints

B+ Tree

B+ Tree Example


Hasing

Hash Table, Hashing - Geeeks, Hashing Function, Universal Hasing

djb2 Hashing

Bucket Size
good hash table primes

What are Hash Functions and How to choose a good Hash Function?

Bloom Filter, Bloom Filter - Geeks

Bloom Filter Example

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

About

Algorithms Specialization - Stanford

www.coursera.org/specializations/algorithms

Topics

algorithmalgorithms-and-data-structuresc-plus-plusdata-structurespython3

Resources

Readme
Activity

Stars

8 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

Packages

Used by

Contributors

Languages

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.