-
Notifications
You must be signed in to change notification settings - Fork 0
Reference
Igor Ilin edited this page Mar 24, 2018
·
4 revisions
* Insertion sort: #main.arrays.SortingAlgorithms.insertionSort()
* Merge sort: #main.arrays.SortingAlgorithms.mergeSort()
* Bubblesort: #main.arrays.SortingAlgorithms.bubbleSort()* Maximum-subarray problem: #main.arrays.ArrayAlgorithms.maxSubarray()
* Square matrix multiplication: #main.arrays.ArrayAlgorithms.squareMatrixMultiply()* Binary Heap (min/max): #main.datastructures.BinaryHeap
* Heapsort: #main.arrays.SortingAlgorithms.heapSort()
* Priority queue (min/max): #main.datastructures.PriorityQueue* Quicksort: #main.arrays.SortingAlgorithms.quickSort()
* Randomized quicksort: #main.arrays.SortingAlgorithms.randomizedQuickSort()* Counting sort: #main.arrays.SortingAlgorithms.countingSort()
* Radix sort: #main.arrays.SortingAlgorithms.radixSort()
* Bucket sort: #main.arrays.SortingAlgorithms.bucketSort()* Randomized select: #main.arrays.ArrayAlgorithms.randomizedSelect()* Stack: #main.datastructures.Stack
* Queue: #main.datastructures.Queue
* Linked list: #main.datastructures.LinkedList* Direct-address table: #main.datastructures.hash.DirectAddressTable
* Hash table with chaining: #main.datastructures.hash.ChainedHashTable
* Open addressing: #main.datastructures.hash.OpenAddressTable* In order walk: #main.datastructures.tree.BinarySearchTree.inOrderWalk()
* Search (recursive): #main.datastructures.tree.BinarySearchTree.recursiveSearch()
* Search (iterative): #main.datastructures.tree.BinarySearchTree.iterativeSearch()
* Minimum: #main.datastructures.tree.BinarySearchTree.minNode()
* Maximum: #main.datastructures.tree.BinarySearchTree.maxNode()
* Successor: #main.datastructures.tree.BinarySearchTree.successorNode()
* Precessor: #main.datastructures.tree.BinarySearchTree.predecessorNode()
* Insertion: #main.datastructures.tree.BinarySearchTree.insert()
* Deletion: #main.datastructures.tree.BinarySearchTree.delete()* Insertion: #main.datastructures.tree.RedBlackTree.insertFixup()
* Deletion: #main.datastructures.tree.RedBlackTree.delete()* Select: #main.datastructures.tree.OrderedStatisticsTree.select()
* Rank: #main.datastructures.tree.OrderedStatisticsTree.calcRank()
* Insert: #main.datastructures.tree.OrderedStatisticsTree.insertFixup()
* Delete: #main.datastructures.tree.OrderedStatisticsTree.delete()* Rod cutting (top-down recursive): #main.dynamic.RodCutting
* Matrix chain order: #main.dynamic.MatrixChainMultiplication
* Longest common subsequence: #main.dynamic.LongestCommonSubsequence
* Optimal binary search tree: #main.dynamic.OptimalBinarySearchTree* Activity-selection problem: #main.greedy.ActivitySelector
* Huffman codes: #main.greedy.HuffmanCoding* Multipop: #main.datastructures.Stack.multiPop
* Binary counter: #main.amortized.BinaryCounter* Search: #main.datastructures.advanced.BTree.search()
* Insert: #main.datastructures.advanced.BTree.insert()
* Delete: #main.datastructures.advanced.BTree.delete()
* In order walk: #main.datastructures.advanced.BTree.inOrderWalk()* Insert: #main.datastructures.advanced.FibonacciMinHeap.insert()
* Delete: #main.datastructures.advanced.FibonacciMinHeap.delete()
* Union: #main.datastructures.advanced.FibonacciMinHeap.union()
* Extract min: #main.datastructures.advanced.FibonacciMinHeap.extractMin()
* Decrease key: #main.datastructures.advanced.FibonacciMinHeap.decreaseKey()* Member: #main.datastructures.advanced.VanEmdeBoasTree.contains()
* Minimum: #main.datastructures.advanced.VanEmdeBoasTree.min()
* Maximum: #main.datastructures.advanced.VanEmdeBoasTree.max()
* Predecessor: #main.datastructures.advanced.VanEmdeBoasTree.predecessor()
* Successor: #main.datastructures.advanced.VanEmdeBoasTree.successor()
* Insert: #main.datastructures.advanced.VanEmdeBoasTree.insert()
* Delete: #main.datastructures.advanced.VanEmdeBoasTree.delete()* Connected components: #test.datastructures.advanced.DisjointSetForestTest.testConnectedComponents()
* Disjoint-set forest: #main.datastructures.advanced.DisjointSetForest* Representation: #main.graph.Graph
* Breadth-first search: #main.graph.algorithms.elementary.BreadthFirstSearch
* Depth-first search: #main.graph.algorithms.elementary.DepthFirstSearch
* Topological sort: #main.graph.algorithms.elementary.TopologicalSort* Kruskal algorithm: #main.graph.algorithms.spanning.KruskalMinSpanningTree
* Prim algorithm: #main.graph.algorithms.spanning.PrimMinSpanningTree* Bellman-Ford algorithm: #main.graph.algorithms.shortest.BellmanFordShortestPath
* DAG shortest path: #main.graph.algorithms.shortest.DAGShortestPath
* Dijkstra algorithm: #main.graph.algorithms.shortest.DijkstraShortestPath* Matrix: #main.graph.algorithms.shortest.all.MatrixShortestPaths
* Floyd-Warshall algorithm: #main.graph.algorithms.shortest.all.FloydWarshallShortestPaths
* Transitive closure: #main.graph.algorithms.shortest.all.TransitiveClosure
* Johnson algorithm: #main.graph.algorithms.shortest.all.JohnsonAllShortestPaths* Edmonds-Karp algorithm: #main.graph.algorithms.maxflow.EdmondsKarpMaxFlow* Fibonacci numbers: #main.parallel.FibNumbers
* Matrix-vector multiplication: #main.parallel.MatrixVectorMultiply
* Matrix multiplication: #main.parallel.SquareMatrixMultiply
* Binary search: #main.arrays.ArrayAlgorithms.binarySearch()* Linear equations: #main.matrix.LinearEquations
* Inverting matrices: #main.matrix.InverseMatrix* Simplex algorithm: #main.linear.SimplexAlgorithm* Plus/minus, multiplication: #main.polynomial.Polynomial* Euclid algorithm: #main.number.NumberAlgorithms.euclid()
* Euclid algorithm (extended): #main.number.NumberAlgorithms.extEuclid()
* Modular linear equation: #main.number.NumberAlgorithms.modularSolve()
* Modular exponentiation: #main.number.NumberAlgorithms.modularExp()
* Pseudoprime: #main.number.NumberAlgorithms.isPseudoPrime()
* Miller-Rabin prime: #main.number.NumberAlgorithms.isMillerRabinPrime()
* Pollard-Rho heuristic: #main.number.NumberAlgorithms.pollardRhoFactor()* Naive: #main.string.StringMatching.naiveMatch()
* Rabin-Karp algorithm: #main.string.StringMatching.rabinKarpMatch()
* Finite automata: #main.string.StringMatching.finiteAutomationMatch()
* Knuth-Morris-Pratt algorithm: #main.string.StringMatching.kmpMatch()* 2-segments (vectors) direction: #main.geometry.Vector.directionFrom()
* Angle turn direction: #main.geometry.GeometryUtils.angleDirection()
* 2-segments (vectors) intersection: #main.geometry.Vector.intersects()
* Any-pair segments (vectors) intersection: #main.geometry.VectorsIntersection.anyIntersect()
* Graham scan convex hull: #main.geometry.GrahamScanConvexHull* Vertex-cover problem: #main.approximation.VertexCoverAlgorithm
* Traveling-salesman problem: #main.approximation.TravelingSalesmanAlgorithm
* Set-covering problem: #main.approximation.SetCoverAlgorithm
* Randomized MAX-3-CNF satisfiability problem: #main.approximation.Max3CnfSatAlgorithm
* Weighted vertex-cover problem: #main.approximation.WeightedVertexCoverAlgorithm
* Subset-sum problem: #main.approximation.SubsetSumAlgorithm