MCPcopy Create free account

hub / github.com/VAR-solutions/Algorithms / functions

Functions3,327 in github.com/VAR-solutions/Algorithms

⨍ Functions 3,327◇ Types & classes 712
↓ 1 callersMethodaddToBack
(int value)
LinkedList/Java/LinkedList.java:29
↓ 1 callersFunctionaddafterlist
LinkedList/C++/doublyLinkedList.cpp:183
↓ 1 callersFunctionaddatbeglist
LinkedList/C++/doublyLinkedList.cpp:146
↓ 1 callersFunctionaddbeforelist
LinkedList/C++/doublyLinkedList.cpp:206
↓ 1 callersMethodadvanceGeneratorsForCurrentTest
Searching/binary search/c/test/catch.hpp:7817
↓ 1 callersFunctionalgoAllPairs
(cost, A, n)
Dynamic Programming/floyd-warshall/allpairs.py:4
↓ 1 callersMethodall
Searching/binary search/c/test/catch.hpp:5937
↓ 1 callersMethodallOk
Searching/binary search/c/test/catch.hpp:2371
↓ 1 callersMethodallSubsets
(int[] array, int n)
Bit Manipulation/GeneratingEverySubsetWithBitmask/java/EverySubset.java:34
↓ 1 callersMethodallowThrows
Searching/binary search/c/test/catch.hpp:9293
↓ 1 callersFunctionalwaysTrue
Searching/binary search/c/test/catch.hpp:479
↓ 1 callersMethodaniket
()
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/Java/MyApp.java:12
↓ 1 callersFunctionapplyFilenamesAsTags
Searching/binary search/c/test/catch.hpp:7096
↓ 1 callersFunctionargsToVector
Searching/binary search/c/test/catch.hpp:4614
↓ 1 callersFunctionartNbridge
Graphs/Finding Articulation Points and bridges/cpp/Finding Articulation Points and bridges.cpp:17
↓ 1 callersMethodassertionPassed
Searching/binary search/c/test/catch.hpp:6764
↓ 1 callersMethodassertionRun
Searching/binary search/c/test/catch.hpp:6771
↓ 1 callersMethodassertionStarting
Searching/binary search/c/test/catch.hpp:8599
↓ 1 callersFunctionastar
(maze, start, end)
Other Algorithms/AStar/astar.py:15
↓ 1 callersFunctionastar
Returns a list of tuples as a path from the given start to the given end in the given maze
Graphs/A star pathfinding algorithm/Astar.py:26
↓ 1 callersMethodbellman_ford
(self, start)
Graphs/Bellman-ford/python/bellman.py:72
↓ 1 callersFunctionbfs
Returns true if there is a path from source 's' to sink 't' in residual graph. Also fills parent[] to store the path */
Greedy Algorithms/ford-fulkerson.cpp:12
↓ 1 callersFunctionbfs
(graph,source)
data structures/Graph/GraphBFS.py:30
↓ 1 callersFunctionbfs
Graphs/SPFA/shortest-path-faster-algorithm.cpp:22
↓ 1 callersFunctionbfs
Returns true if there is a path from source 's' to sink 't' in residual graph. Also fills parent[] to store the path */
Graphs/ford-fulkerson/max_flow.cpp:12
↓ 1 callersFunctionbfs
( start )
Graphs/bfs/javascript/bfs.js:14
↓ 1 callersFunctionbfs
(start int, nodes map[int][]int, fn func (int))
Graphs/bfs/go/bfs.go:27
↓ 1 callersFunctionbfs
Graphs/bfs/c/bfs.c:46
↓ 1 callersMethodbfs
(int rGraph[][], int s, int t, int parent[])
Graphs/FordMaxFlow.java:14
↓ 1 callersMethodbfs
()
Graphs/bfs/java/bfs.java:31
↓ 1 callersFunctionbfs_frontier
(node int, nodes map[int][]int, visited map[int]bool)
Graphs/bfs/go/bfs.go:45
↓ 1 callersFunctionbinary
Other Algorithms/conversion.cpp:18
↓ 1 callersFunctionbinarySearch
Dynamic Programming/WeightedJobScheduling/cpp/weighted_job_scheduling.cpp:15
↓ 1 callersFunctionbinarySearch
(A,num,l,r)
Searching/binary search/python/binarySearch.py:1
↓ 1 callersFunctionbinarySearch
Binary Search
Searching/binary search/go/binarySearch.go:5
↓ 1 callersMethodbinarySearch
Returns index of x if it is present in arr, otherwise -1
Graphs/BinaryTree/kotlin/binaryKotlin.kt:4
↓ 1 callersFunctionbinary_search
(the_array, item, start, end)
Sorting/Timsort/Python/TimSort.py:5
↓ 1 callersFunctionbinary_search
(v : &Vec<i32>, value : i32)
Searching/binary search/rust/binary_search.rs:1
↓ 1 callersFunctionbinary_search
(a, n, x)
Searching/binary search/Ruby/binSearch.rb:1
↓ 1 callersMethodbindProcessName
Searching/binary search/c/test/catch.hpp:4930
↓ 1 callersFunctionbinomialCoef
(n, k)
Dynamic Programming/Binomial Coefficient/Python/binCoeff.py:1
↓ 1 callersFunctionbinomialCoeff
Returns value of Binomial Coefficient C(n, k)
Mathematics/catalan_no/cpp/catalan.cpp:5
↓ 1 callersFunctionbinomialCoeff
(n, k)
Mathematics/NChooseK/python/recursive-binomial.py:1
↓ 1 callersFunctionbinomialCoeff
(n, k)
Mathematics/NChooseK/python/dp-binomial.py:1
↓ 1 callersFunctionbinomialCoeff
Returns value of Binomial Coefficient C(n, k)
Mathematics/NChooseK/cpp/NChooseK.cpp:7
↓ 1 callersFunctionbinomialCoeff
Dynamic Programming/Binomial Coefficient/C/binCoeff.c:5
↓ 1 callersMethodbinomialCoeff
(int n, int k)
Dynamic Programming/Binomial Coefficient/Java/BinCoeff.java:2
↓ 1 callersFunctionbinomialCoefficient
(n, k)
Mathematics/catalan_no/python/catalan.py:4
↓ 1 callersMethodbogoSort
(int[] a)
Sorting/Bogosort/Java/Bogosort.java:5
↓ 1 callersFunctionbogosort
(ary)
Sorting/Bogosort/Ruby/bogosort.rb:10
↓ 1 callersFunctionbrute_force
(a)
Divide and Conquer/closest_points.py:17
↓ 1 callersFunctionbubble_Sort
Sorting/Bubble Sort/CPP/bubble_sort.cpp:11
↓ 1 callersFunctionbubble_sort
(list)
Sorting/Bubble Sort/Javascript/bubble_sort.js:9
↓ 1 callersFunctionbubble_sort
(array: &mut [T])
Sorting/Bubble Sort/Rust/bubble_sort.rs:1
↓ 1 callersFunctionbubble_sort
($array)
Sorting/Bubble Sort/PHP/bubble-sort.php:3
↓ 1 callersFunctionbubble_sort
(arr)
Sorting/Bubble Sort/Python/bubble_sort.py:5
↓ 1 callersFunctionbubble_sort
Sorting/Bubble Sort/C/bubble_sort.c:11
↓ 1 callersFunctionbubble_sort
(array)
Sorting/Bubble Sort/Ruby/bubble_sort.rb:1
↓ 1 callersFunctionbubble_sort_recursively
(arr, i=0, j=0)
Sorting/Bubble Sort/Python/bubble_sort_recursively.py:1
↓ 1 callersFunctionbubblesort
(a sort.Interface)
Sorting/Bubble Sort/Go/bubble_sort.go:16
↓ 1 callersFunctionbucketSort
(list, size)
Sorting/Bucket Sort/Javascript/bucket_sort.js:14
↓ 1 callersFunctionbucketSort
Sorting/Bucket Sort/C++/bucket_sort.cpp:8
↓ 1 callersMethodbucketSort
(int[] a)
Sorting/Bucket Sort/Java/bucket_sort.java:5
↓ 1 callersFunctionbucketsort
Sorting function
Sorting/Bucket Sort/C/bucket_sort.c:27
↓ 1 callersMethodbuild
Searching/binary search/c/test/catch.hpp:9295
↓ 1 callersFunctionbuildTree
(node, start, end int)
Tree/segment tree/golang/segmentTree.go:16
↓ 1 callersMethodbuildTree
(int[] a, int[] tree, int index, int si, int ei)
Tree/segment tree/Java/RangeMinQuery.java:22
↓ 1 callersFunctionbuild_ST
Tree/segment tree/c/segment_tree.c:28
↓ 1 callersMethodbuild_tree
(self, nums, l, r)
Tree/segment tree/python/segment_tree.py:19
↓ 1 callersFunctioncalcDist
Problem specific, not part of decomposition.
Tree/Centroid Decomposition/C++/centroid-decomposition.cpp:53
↓ 1 callersFunctioncalcSubtreeSize
Tree/Centroid Decomposition/C++/centroid-decomposition.cpp:29
↓ 1 callersFunctioncalculate
Other Algorithms/Second-Max-Min-in-SubArray/second-max-min.cpp:5
↓ 1 callersFunctioncalculateGrundy
A function to Compute Grundy Number of 'n' Only this function varies according to the game
Combinatorial Game Theory/Grundy Numbers/grundyNum.cpp:24
↓ 1 callersFunctioncalculateGrundy
A function to Compute Grundy Number of 'n'
Combinatorial Game Theory/Sprague-Grundy Theorem/sprague.cpp:28
↓ 1 callersMethodcalculateHash
(self)
Blockchain/blockchain_algorithm.py:11
↓ 1 callersFunctioncalculateMex
A Function to calculate Mex of all the values in that set.
Combinatorial Game Theory/Grundy Numbers/grundyNum.cpp:12
↓ 1 callersFunctioncalculateMex
A Function to calculate Mex of all the values in that set
Combinatorial Game Theory/Sprague-Grundy Theorem/sprague.cpp:17
↓ 1 callersFunctioncalculate_lps
(pat string, m int, lps []int)
Other Algorithms/KMP/golang/kmp.go:15
↓ 1 callersFunctioncanCompleteCircuit
Greedy Algorithms/Gas Station/containerShip.cpp:4
↓ 1 callersFunctioncatalan
(n)
Mathematics/catalan_no/python/catalan.py:22
↓ 1 callersFunctioncatalan
A Binomial coefficient based function to find nth catalan number in O(n) time
Mathematics/catalan_no/cpp/catalan.cpp:25
↓ 1 callersFunctioncentroidDecomp
Tree/Centroid Decomposition/C++/centroid-decomposition.cpp:65
↓ 1 callersFunctioncheckBipartite
Graphs/check bipartite/cpp/CheckBipartite.cpp:26
↓ 1 callersFunctioncheckParent
(str)
Other Algorithms/checkParent.js:3
↓ 1 callersFunctionchoose_pivot
data structures/quick.cpp:38
↓ 1 callersFunctioncleanUp
Searching/binary search/c/test/catch.hpp:7658
↓ 1 callersFunctioncleanUpContext
Searching/binary search/c/test/catch.hpp:7879
↓ 1 callersFunctionclosest
(a)
Divide and Conquer/closest_points.py:42
↓ 1 callersMethodcocktailSort
(int a[])
Sorting/Cocktail/cocktail.java:2
↓ 1 callersFunctioncocktailsort
Sorting/Cocktail/C/Cocktail.c:11
↓ 1 callersFunctioncodes
Greedy Algorithms/Huffman/cpp/huffmanInCPP.cpp:38
↓ 1 callersFunctioncoinChange
Dynamic Programming/coin change/cpp/CoinChangeDP.cpp:7
↓ 1 callersFunctioncombSort
Comb Sort
Sorting/Comb Sort/Go/combSort.go:28
↓ 1 callersFunctioncombineLeafs
combineLeafs combines two trees into a single new one without a value. Note that we intentionally pass parameters by value to have 'fresh' trees.
Greedy Algorithms/Huffman/go/huffman.go:77
↓ 1 callersFunctioncombsort
(array, shrink = 1.247330950103979)
Sorting/Comb Sort/Ruby/comb_sort.rb:11
↓ 1 callersFunctioncompare
Searching/binary search/c/test/catch.hpp:1382
↓ 1 callersMethodcompare
+============================================================================= hashdecode - decode an arbitrary IR code. Instead of decoding using a s
Arduino_Code/Arduino-IRremote/irRecv.cpp:201
↓ 1 callersFunctioncompute
( a, b)
Mathematics/harmonic mean/python/Harmonic-Mean.py:9
↓ 1 callersFunctioncomputeHash
Computes the hash value of a given board
Combinatorial Game Theory/Zobrist Hashing/zobrist.cpp:59
↓ 1 callersFunctioncomputeLPSArray
(pat, M, lps)
Other Algorithms/KMP/pyhton/kmpsearch.py:24
← previousnext →701–800 of 3,327, ranked by callers