Mathematics:
- Sieve of Eratosthenes (prime finding)
- http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
- http://www.shafaetsplanet.com/planetcoding/?p=624
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/eratosthenes_sieve&usg=ALkJrhhwtnMHMOYCdg4BxIfMFpyTHN-_pA
- Bitwise Sieve
- Segmented Sieve
- prime factorization
- GCD, LCM
- Factorial
- Fibonacci
- Counting, Permutation, combination
- Exponentiation
- Modular Arithmetic
- Euclid, Extended euclid
- http://zobayer.blogspot.com/2009/07/extended-euclidean-algorithm.html
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/euclid_algorithm&usg=ALkJrhhkz3tb4aXWHeD8eIJvJCQhe-jn7Q
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/extended_euclid_algorithm&usg=ALkJrhgjyM7s9peFmIRPQqhXdBGE9-CeHw
Data Structure:
- Stack
- Queue
- Priority Queue
- Linked list
- Heap
- Hash table
- Disjoint Set, Union Find
- Binary Search Tree
- Trie, Suffix Array
- Binary Indexed Tree(BIT)
- Segmented Tree
- Heavy Light decompositon
Sorting:
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=sorting http://bongobani.blogspot.com/2010/06/blog-post_1625.html
- Bubble Sort
- Selection Sort
- Insertion Sort
- Shell Sort
- Quick Sort
- Merge Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Heap Sort
Searching:
- Linear Search
- Binary Search
- Ternary Search
- Map, HashMap
Dynamic Programming:
- Some resources:
- Rod Cutting
- Maximum Sum (1D, 2D)
- Coin Change
- Longest Common Subsequence
- Longest Increasing subsequence, Longest Decreasing Subsequence
- Calculating nCr using DP
- Matrix Chain multiplication
- Edit Distance
- 0-1 Knapsack
- Bitmask DP
- Traveling Salesman problem
- Digit DP
Greedy algorithm:
- Activity selection/Task scheduling problem
- Huffman coding
- Fractional knapsack problem
- Graph Theory:
- https://sites.google.com/site/smilitude/shortestpath
- https://sites.google.com/site/smilitude/shortestpath_problems
- http://www.codechef.com/wiki/tutorial-graph-theory-part-1
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs1
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs2
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs3
- Graph Representation(matrix, list/vector)
- Breadth First Search(BFS)
- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
- http://www.shafaetsplanet.com/planetcoding/?p=604
- http://www.shafaetsplanet.com/planetcoding/?p=639
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/bfs&usg=ALkJrhinv0P87U0v_VXJhm3L6aGS5KEuPA
- Depth First Search(DFS)
- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/depthSearch.htm
- http://www.shafaetsplanet.com/planetcoding/?p=973
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/dfs&usg=ALkJrhiWHq30PgqeB1q11ZSAJrvMeOJksw
- Bipartite Graph checking
- Topological Sort
- https://sites.google.com/site/smilitude/topsort
- http://www.shafaetsplanet.com/planetcoding/?p=848
- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/topoSort.htm
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/topological_sort&usg=ALkJrhhAS83fGpkoZIfziKQZIpYQy4JZ9A
- Strongly Connected Component (SCC)
- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/strongComponent.htm
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/strong_connected_components&usg=ALkJrhip3cmRxf-Uk_1COz-PHg57GuwEGg
- Minimum Spanning Tree(MST)
- Kruskals Algorithm
- Directed MST
- All pair's shortest path (Floyd Warshall)
- Djkastra algorithm
- Bellman Ford Algorithm
- Directed Acyclic Graph
- Bipartite Matching
- Max-Flow, Min-cost max-flow
- Cayley's Theorem
- Articulation Point
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/cutpoints&usg=ALkJrhiSuFiBqY_EBgCC68vfrvW2o5vZnA Bridge
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/bridge_searching&usg=ALkJrhjv4XdY8Jh7vYLW0UbVsCIgscwhWg
- Euler tour/path
- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/eulerTour.htm
- http://zobayer.blogspot.com/2010/06/euler-tour.html
- http://www.graph-magics.com/articles/euler.php
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/euler_path&usg=ALkJrhhfu-QYqtQCLEcIXxB-nQ1lbebqvw
- Hamiltonian Cycle
- Stable Marriage problem
- Chinese Postman problem
- Minimum Vertex Cover(Graph+DP)
Number Theory:
- Josephus Problem
- http://en.wikipedia.org/wiki/Josephus_problem
- http://www.cut-the-knot.org/recurrence/flavius.shtml
- http://translate.googleusercontent.com/translate_c?act=url&depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=auto&tl=en&twu=1&u=http://e-maxx.ru/algo/joseph_problem&usg=ALkJrhgMHDKM8tt5iI-GjN79rqFrWqWtFg
- Farey Sequence,Stern-brocot Tree
- Catalan numbers
- Euler's phi
- Burnside's lemma/circular permutation
- Modular inverse
- Probability
- Chinese Remainder Theorem
- Gaussian Elmination method
- Dilworth's Theorem
- Matrix Exponentiation
- Determinant of a matrix
- RSA public key crypto System
Computation Geometry:
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=geometry1
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=geometry2
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=geometry3
- http://www.personal.kent.edu/~rmuhamma/Compgeometry/compgeom.html
- Pick's Theorem
- Convex hull
- Line Intersection
- Segment circle intersection
- Point in a polygon
- Area of a polygon
- Line Sweeping
- Polygon intersection
- Closest Pair
###Game Theory: - http://potasiyam.com/farsan/
- Take Away game
- Nim
- Sprague-grundy Number
String:
* http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=stringSearching
* http://doinik-iut.com/archives/23106
- Naive String matching
- Rabin karp Algo
- Finite Automata
- Knuth-Marris-Pratt Algo
- Manacher's Algo
- Aho korasick's Algo
- Boyer-Moore Algorithm
###Others:
- Recursion
- Backtracking
- Hungarian Algorithm
- C++ STL(Standard Template Library)
- Bitwise operations
- http://www.codechef.com/wiki/tutorial-bitwise-operations
- http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=bitManipulation
- http://zobayer.blogspot.com/2009/12/bitwise-operations-in-cc-part-1.html
- http://zobayer.blogspot.com/2009/12/bitwise-operations-in-c-part-2.html
- http://zobayer.blogspot.com/2009/12/bitwise-operations-in-c-part-3.html
From:
Hasan Abdullah Vai
){kind=link}
0 Comments
If you have any doubts, Please let me know