Skip to content

Instantly share code, notes, and snippets.

@yokotak0527
Last active February 6, 2017 16:19
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save yokotak0527/69b5b41d6be2c1d06ace8889f0a8eef0 to your computer and use it in GitHub Desktop.
Save yokotak0527/69b5b41d6be2c1d06ace8889f0a8eef0 to your computer and use it in GitHub Desktop.
Algorithm List
- Backtraking
- Knight's tour problem
- N Queens Problem
- Cryptography
- Affine Cipher
- Caesar Cipher
- Dynamic Programming
- Catalan Number
- Fibonacci Sequence
- Integer Partition
- Knapsack Problem
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Palindromic Subsequence
- Maximum Subarray
- Maximum Sum Path
- Pascal's Triangle
- Shortest Common Supersequence
- Sliding Window
- Ugly Numbers
- Graph Search
- Bellman-Ford
- BFS
- Find-Bridges
- DFS
- Depth-Limited Search
- Dikstra
- Folyd-Warshall
- PageRank Algorithm
- Topological-Sort
- Greedy
- Job Scheduling Algorithm
- Majority Element(Boyer–Moore majority vote algorithm)
- Minimum Spanning Tree
- Kruskal's Algorithm
- Prim's Algorithm
- Number Theory
- Euclidean Algorithm
- Sieve of Eratosthenes
- Search
- Binary Search
- Sorting
- Bucket Sort
- Bubble Sort
- Comb Sort
- Counting Sort
- Cycle Sort
- Heapsort
- Insertion Sort
- Merge Sort
- Pigeonhole Sort
- Quicksort
- Radix Sort
- Selection Sort
- Shellsort
- Pancake Sort
- String
- Edit Distance (レーベンシュタイン距離,編集距離)
- KMP Substring Search
- Rabin-karp Algorithm
- Suffix Array (construction & usage)
- Z Algorithm
- Tree
 - Binary Search Tree (二分探索木)
- Binary Tree Traversal (木構造の横断)
- Lowest Common Ancestor
- Uncategorized
- Flood Fill
- Cellular Automate
- Create Maze
- Magic Square
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment