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 callersMethodgcd
(int a, int b)
Mathematics/GCD/java/gcd.java:6
↓ 1 callersFunctiongcdExtend
(a,b,x,y)
Mathematics/GCD/python/Extended_Gcd.py:2
↓ 1 callersFunctiongcdExtended
(a, b, x, y)
Mathematics/GCD/euclidean_algo_GCD_extended.py:5
↓ 1 callersFunctiongenerateNeighbours
(inMatrix)
Searching/8-puzzleProblem/8-puzzleProblem.py:18
↓ 1 callersFunctiongenerateRandomGraph
Graphs/Minimum Spanning Tree/C++/mst.cpp:45
↓ 1 callersFunctiongenerateSlice
Generates a slice of size, size filled with random numbers
Sorting/Selection Sort/Go/selection_sort.go:19
↓ 1 callersFunctiongenerateSlice
Generates a slice of size, size filled with random numbers
Sorting/Insertion Sort/Go/insertion_sort.go:19
↓ 1 callersFunctiongenerateSlice
Generates a slice of size with random numbers
Sorting/Comb Sort/Go/combSort.go:18
↓ 1 callersFunctiongenerateSlice
Generates a slice of size with random numbers
Sorting/Pancake Sorting/Go/pancakeSort.go:18
↓ 1 callersMethodgetAdjacent
Método que retorna o iterator dos vertices adjacentes, ou null se sao exitir @param v Nome do vétice @return O iterador com todos os vétices adjacente
Graphs/Dijkstra Algorithm/Java/Grafo.java:133
↓ 1 callersMethodgetAns
(int maxcap, int[] values, int[] weights)
Greedy Algorithms/Fractional Knapsack/java/Fractional_Knapsack.java:8
↓ 1 callersFunctiongetBalance
Get Balance factor of node N
Tree/AVLTree/AVL_Tree.cpp:81
↓ 1 callersFunctiongetBucketIndex
Sorting/Bucket Sort/C/bucket_sort.c:125
↓ 1 callersFunctiongetBytes
(key interface{})
data structures/Bloom Filter/bloomfilter.go:91
↓ 1 callersMethodgetCardNo
()
Other Algorithms/Luhn/luhn.js:24
↓ 1 callersMethodgetCurrentIndex
Searching/binary search/c/test/catch.hpp:8104
↓ 1 callersFunctiongetCurrentTimestamp
Searching/binary search/c/test/catch.hpp:10431
↓ 1 callersMethodgetDepth
(ElementBST node)
Tree/Binary Search Tree/bst.java:94
↓ 1 callersMethodgetDescription
Searching/binary search/c/test/catch.hpp:10224
↓ 1 callersMethodgetEdge
Método que retorna uma aresta se ela existir @param v Nome do vértice de início (estação de partida) @param u Nome do vértice final (estação de destin
Graphs/Dijkstra Algorithm/Java/Grafo.java:103
↓ 1 callersMethodgetEndNode
(self)
data structures/Graph/GraphAL.py:5
↓ 1 callersMethodgetEndNode
(self)
data structures/Graph/Example/GraphExample.py:5
↓ 1 callersMethodgetEvenNumberList
()
Other Algorithms/Luhn/luhn.js:41
↓ 1 callersMethodgetExpressionInMacro
Searching/binary search/c/test/catch.hpp:8216
↓ 1 callersMethodgetFilterSum
()
Other Algorithms/Luhn/luhn.js:73
↓ 1 callersMethodgetGeneratorIndex
Searching/binary search/c/test/catch.hpp:7812
↓ 1 callersMethodgetHeight
Tree/AVLTree/AVL.cpp:299
↓ 1 callersFunctiongetLOG
Mathematics/log 2 n/cpp/calc_log_2-n.cpp:6
↓ 1 callersMethodgetLps
(String pat, int m)
Other Algorithms/KMP/java/KMP.java:34
↓ 1 callersMethodgetMarkDuration
Arduino_Code/Arduino-IRremote/ir_Lego_PF_BitStreamEncoder.h:78
↓ 1 callersFunctiongetMin
Graphs/Prims Algorithm/C++/prims.cpp:11
↓ 1 callersFunctiongetNthUglyNo
Function to get the nth ugly number*/
Dynamic Programming/Ugly Numbers/cpp/ugly_numbers.cpp:13
↓ 1 callersMethodgetOddNumberList
()
Other Algorithms/Luhn/luhn.js:30
↓ 1 callersMethodgetParent
(self, curNode, target, parent)
Tree/Binary Search Tree/bstree.py:137
↓ 1 callersMethodgetPath
Método que converte os vétices visitados em uma pilha de paths (caminhos) @param visited HashMap com os vétices visitados no algoritmo de caminho míni
Graphs/Dijkstra Algorithm/Java/Grafo.java:189
↓ 1 callersMethodgetPauseDuration
Arduino_Code/Arduino-IRremote/ir_Lego_PF_BitStreamEncoder.h:80
↓ 1 callersMethodgetPisanoNumber
(int m)
Recursive Algorithms/Fibonacci/Java/fibonacciModM.java:10
↓ 1 callersMethodgetPrevious
()
Graphs/Dijkstra Algorithm/Java/Path.java:35
↓ 1 callersFunctiongetRandomInt
(min,max)
Random Number/random.js:4
↓ 1 callersMethodgetRunner
Searching/binary search/c/test/catch.hpp:7809
↓ 1 callersMethodgetTotal
()
Other Algorithms/Luhn/luhn.js:65
↓ 1 callersMethodgetValue
Searching/binary search/c/test/catch.hpp:2543
↓ 1 callersMethodgetVecninos
()
Graphs/bfs/java/bfs.java:23
↓ 1 callersMethodgetVertex
()
Graphs/Dijkstra Algorithm/Java/Path.java:27
↓ 1 callersFunctiongetWays
(n, c)
Dynamic Programming/coin change/python/coin-change.py:1
↓ 1 callersFunctiongetWays
DP solution TC = O(m*n) where m = size of coins vector SC = O(m*n)
Dynamic Programming/coin change/cpp/coin change.cpp:44
↓ 1 callersFunctiongetWaysHelper
Dynamic Programming/coin change/cpp/coin change.cpp:15
↓ 1 callersFunctionget_change
(m, c)
Dynamic Programming/coin change/python/min_coin_change_value.py:2
↓ 1 callersFunctionget_change
Dynamic Programming/coin change/cpp/min_coin_change_value.cpp:6
↓ 1 callersFunctionget_column
Returns an i-th column of a square.
Backtracking/Magic Squares/Python/magic_squares.py:21
↓ 1 callersMethodget_data
(self)
data structures/linked list/python/Stack_with_Singly_Linked_List.py:6
↓ 1 callersMethodget_data
(self)
data structures/linked list/python/Queue_with_Singly_Linked_List.py:6
↓ 1 callersFunctionget_majority
(a)
Recursive Algorithms/Majority Element/python/majority_element.py:1
↓ 1 callersFunctionget_optimal_value
Greedy Algorithms/Fractional Knapsack/cpp/fractional_knapsack.cpp:5
↓ 1 callersFunctiongetlogbase2n
(n)
Mathematics/log 2 n/python/log2n.py:3
↓ 1 callersFunctiongnomeSort
A function to sort the algorithm using gnome sort
Sorting/Gnome Sort/cppgnome.cpp:5
↓ 1 callersMethodgnomeSort
(int arr[], int n)
Sorting/Gnome Sort/gnome.java:3
↓ 1 callersMethodgnomesort!
Sorting/Gnome Sort/Ruby/GnomeSort.rb:2
↓ 1 callersMethodgraphColourUtil
(self, m, colour, v)
Backtracking/mcoloring/mcoloring.py:19
↓ 1 callersMethodgraphColouring
(self, m)
Backtracking/mcoloring/mcoloring.py:30
↓ 1 callersFunctiongreatCommonDiv
Mathematics/GCD/C/gcd.c:3
↓ 1 callersFunctiongridUniquePath
Dynamic Programming/Grid Unique Paths/file.cpp:5
↓ 1 callersFunctiongridUniquePathDP
Dynamic Programming/Grid Unique Paths/file.cpp:17
↓ 1 callersMethodhandleFatalErrorCondition
Searching/binary search/c/test/catch.hpp:6851
↓ 1 callersFunctionharmonic
(a, b)
Mathematics/harmonic mean/python/harmonic_mean.py:1
↓ 1 callersFunctionharmonic
Mathematics/harmonic mean/cpp/harmonic-mean.cpp:4
↓ 1 callersFunctionharmonicMean
Mathematics/harmonic mean/C/harmonicMean.c:3
↓ 1 callersMethodhas
Tree/AVLTree/AVL.cpp:261
↓ 1 callersMethodhasChildren
Searching/binary search/c/test/catch.hpp:6184
↓ 1 callersMethodhasLongName
Searching/binary search/c/test/catch.hpp:4734
↓ 1 callersMethodhasMessage
Searching/binary search/c/test/catch.hpp:8200
↓ 1 callersMethodhasShortName
Searching/binary search/c/test/catch.hpp:4731
↓ 1 callersFunctionheapSort
main function to do heap sort
Sorting/Heapsort/php/heap_sort.php:34
↓ 1 callersFunctionheapSort
(arr)
Sorting/Heapsort/Javascript/heapsort.js:64
↓ 1 callersFunctionheapSort
(arr)
Sorting/Heapsort/Python/heapsort.py:12
↓ 1 callersFunctionheap_sort
Sorts the array in assending order
Sorting/Heapsort/Ruby/heapsort.rb:23
↓ 1 callersFunctionhexa
Other Algorithms/conversion.cpp:42
↓ 1 callersFunctionhld
Other Algorithms/HeavyLightDecompotion.cpp:37
↓ 1 callersFunctionhld
Tree/Heavy Light Decomposition/hld.cpp:22
↓ 1 callersFunctioninOrder
Tree/Traverals/CPP/inOrder.cpp:12
↓ 1 callersFunctioninOrderPredecesor
Tree/AVLTree/AVL.cpp:192
↓ 1 callersFunctioninOrderSuccessor
Tree/AVLTree/AVL.cpp:208
↓ 1 callersMethodin_order
(node=@root, &block)
Tree/Binary Search Tree/Ruby/bst.rb:31
↓ 1 callersMethodincreaseStackCapacity
data structures/stack/Kotlin/StackUsingArray.kt:33
↓ 1 callersFunctioninit
Other Algorithms/Suffix Automaton/CPP/SA.cpp:13
↓ 1 callersFunctioninit
()
Graphs/bfs/python/bfs.py:88
↓ 1 callersFunctioninit
Graphs/disjoint-sets/union-find.cpp:10
↓ 1 callersFunctioninit
()
Graphs/Bellman-ford/python/bellman.py:88
↓ 1 callersFunctioninitTable
Initializes the table
Combinatorial Game Theory/Zobrist Hashing/zobrist.cpp:50
↓ 1 callersMethodinit_bellman
(self, source)
Graphs/Bellman-ford/python/bellman.py:57
↓ 1 callersMethodinitialise
data structures/hash/hashfunctions.cpp:16
↓ 1 callersFunctioninitialize
Graphs/SPFA/shortest-path-faster-algorithm.cpp:14
↓ 1 callersFunctioninorder
(root)
Graphs/BinaryTree/python/binaryTree.py:24
↓ 1 callersMethodinorder
* In Order Traversal */
Tree/Binary Search Tree/Binary_Search_Tree.cpp:320
↓ 1 callersMethodinorder
()
Graphs/BinaryTree/java/binaryTree.java:47
↓ 1 callersMethodinorderRec
(Node root)
Graphs/BinaryTree/java/binaryTree.java:52
↓ 1 callersFunctioninorderTraversal
function for the inorder traversal of the tree so as to store the node values in 'arr' in sorted order
Tree/Binary Search Tree/Bst to min heap.cpp:33
↓ 1 callersMethodinorders
()
Tree/Traverals/JAVA/inorder.java:46
↓ 1 callersFunctioninsert
Mathematics/factorial/Factorial.c:14
↓ 1 callersFunctioninsert
Mathematics/power/c/x_to_x.c:14
← previousnext →1,001–1,100 of 3,327, ranked by callers