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 callersFunctiondisplay
data structures/stack/c/stack_using_linkedList.c:48
↓ 1 callersFunctiondisplay
data structures/queue/c/queue_using_array.c:65
↓ 1 callersFunctiondisplay
data structures/queue/c/queue_using_linkedList.c:60
↓ 1 callersMethoddisplay
* Display Tree Structure */
Tree/Binary Search Tree/Binary_Search_Tree.cpp:356
↓ 1 callersMethoddivide
(nums)
Sorting/Merge Sort/Ruby/merge_sort.rb:6
↓ 1 callersFunctiondoublyLinkedList
data structures/linked list/c/linked list.c:174
↓ 1 callersMethodedges
(self)
data structures/Graph/GraphDictionaries.py:16
↓ 1 callersFunctionedit_distance
(s, t)
Dynamic Programming/Editing Distance/python/editing_distance.py:2
↓ 1 callersFunctionedit_distance
Dynamic Programming/Editing Distance/cpp/editing_distance.cpp:5
↓ 1 callersFunctionegcd
(a int, b int)
Mathematics/modularInverse/go/src/main.go:8
↓ 1 callersFunctioneggDrop
(n, k)
Dynamic Programming/Egg Dropping Puzzle/python/eggDroppingPuzzle.py:3
↓ 1 callersFunctioneggDrop
Dynamic Programming/Egg Dropping Puzzle/cpp/eggDroppingPuzzle.cpp:8
↓ 1 callersMethodencodeTo
Searching/binary search/c/test/catch.hpp:9997
↓ 1 callersFunctionenddel
Function to delete at end
LinkedList/C/linkedList.c:93
↓ 1 callersFunctionendins
Function to insert at end
LinkedList/C/linkedList.c:25
↓ 1 callersFunctionenforceNoDuplicateTestCases
Searching/binary search/c/test/catch.hpp:7335
↓ 1 callersFunctionenforceNotReservedTag
Searching/binary search/c/test/catch.hpp:8278
↓ 1 callersFunctionenqueue
data structures/queue/c/queue_using_array.c:33
↓ 1 callersFunctionenqueue
data structures/queue/c/queue_using_linkedList.c:12
↓ 1 callersMethodenqueue
data structures/queue/Kotlin/QueueUsingArray.kt:11
↓ 1 callersFunctioneuclidean_distance
Mathematics/euclidean distance/euclidean_distance.cpp:4
↓ 1 callersFunctionevaluate
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/Cpp/Tic-Tac-Toe.cpp:21
↓ 1 callersMethodexceptionEarlyReported
Searching/binary search/c/test/catch.hpp:6847
↓ 1 callersMethodexists
(Tip e)
Tree/Binary Search Tree/bst.java:158
↓ 1 callersFunctionexp
Mathematics/power/c/x_to_x.c:52
↓ 1 callersMethodexp
(long n, int e, int m)
Mathematics/modular exp/java/ModularExp.java:3
↓ 1 callersMethodexpandAliases
Searching/binary search/c/test/catch.hpp:9345
↓ 1 callersMethodexpandDecomposedExpression
Searching/binary search/c/test/catch.hpp:8246
↓ 1 callersMethodexpectedToFail
Searching/binary search/c/test/catch.hpp:8384
↓ 1 callersFunctionexpected_row_sum
Calculates the expected row sum based on square size.
Backtracking/Magic Squares/Python/magic_squares.py:16
↓ 1 callersFunctionextended_bottom_cut_rod
(p, n)
Dynamic Programming/Cutting Rod/python/cutting_rod.py:11
↓ 1 callersFunctionextended_bottom_cut_rod
Dynamic Programming/Cutting Rod/cpp/cutting_rod.cpp:5
↓ 1 callersFunctionextractClassName
Searching/binary search/c/test/catch.hpp:7425
↓ 1 callersFunctionfactorial
Mathematics/factorial/Factorial.c:52
↓ 1 callersFunctionfactorial
(number)
Mathematics/factorial/python/_factorial.py:1
↓ 1 callersFunctionfactorial
Mathematics/factorial/cpp/FactorialOfLargeNumber.cpp:8
↓ 1 callersFunctionfactorial
Mathematics/factorial/cpp/factorial.cpp:4
↓ 1 callersFunctionfactorial
(num)
Mathematics/factorial/javascript/factorial.js:1
↓ 1 callersFunctionfactorial
Mathematics/factorial/C/factorial.c:3
↓ 1 callersMethodfactorial
(int n)
Mathematics/factorial/java/Factorial.java:11
↓ 1 callersFunctionfib
(x int)
Mathematics/fibonacci/go/fibonacci.go:7
↓ 1 callersFunctionfib
(n)
Recursive Algorithms/Fibonacci/Python/fibonacci.py:1
↓ 1 callersFunctionfib
(n)
Dynamic Programming/fibonacci/python/fibonacci.py:1
↓ 1 callersFunctionfib
(n)
Dynamic Programming/fibonacci/ruby/fibonacci.rb:1
↓ 1 callersFunctionfib
memoization array
Dynamic Programming/fibonacci/go/fibonacci.go:9
↓ 1 callersFunctionfib
(n)
Dynamic Programming/fibonacci/java/fibonacci.js:1
↓ 1 callersFunctionfib
Dynamic Programming/fibonacci/c/fibonacci.c:5
↓ 1 callersMethodfib
(int n)
Dynamic Programming/fibonacci/java/fibonacci.java:8
↓ 1 callersFunctionfibMonaccianSearch
Searching/Fibonacci Search/fibonacci_search.c:6
↓ 1 callersMethodfibMonaccianSearch
(int arr[], int x, int n)
Searching/Fibonacci Search/Java/Fibonaccisearch.java:12
↓ 1 callersFunctionfibo
* Recursive function to find nth Fibonacci term */
Mathematics/fibonacci/C/fibonacci.c:32
↓ 1 callersFunctionfibonacci
Mathematics/fibonacci/cpp/fibonacciUsingRecursion.cpp:9
↓ 1 callersFunctionfibonacci
Mathematics/fibonacci/cpp/fibonacciBinet.cpp:5
↓ 1 callersFunctionfibonacciSearch
(arr, x, n)
Searching/Fibonacci Search/JavaScript/fibonacciSearch.js:22
↓ 1 callersFunctionfillsparse
Graphs/LCA/lca1.cpp:37
↓ 1 callersFunctionfinLongestOverAll
Dynamic Programming/Longest Path Matrix/cpp/longPathMat.cpp:22
↓ 1 callersMethodfind
(int count,int ro,HashSet<Integer> row,HashSet<Integer> col,int A,ArrayList<String> temp,StringBuilder build,S
Backtracking/Nqueens.java:9
↓ 1 callersFunctionfindBestMatrix
(openList)
Searching/8-puzzleProblem/8-puzzleProblem.py:206
↓ 1 callersFunctionfindBestMove
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/tttoptmove.cpp:119
↓ 1 callersFunctionfindBestMove
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/Cpp/Tic-Tac-Toe.cpp:119
↓ 1 callersFunctionfindCentroid
Tree/Centroid Decomposition/C++/centroid-decomposition.cpp:38
↓ 1 callersMethodfindFactorial
( Integer number )
Recursive Algorithms/Factorial/Java/factorial.java:6
↓ 1 callersFunctionfindGCD
Mathematics/GCD/cpp/GCDlarge.cpp:8
↓ 1 callersFunctionfindGolomb
Return the nth element of Golomb sequence
Dynamic Programming/golomb.cpp:8
↓ 1 callersFunctionfindLCM
(a, b)
Mathematics/LCM/python/lcm.py:3
↓ 1 callersFunctionfindLISBit
Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence_bit.cpp:24
↓ 1 callersFunctionfindLongestFromACell
Dynamic Programming/Longest Path Matrix/cpp/longPathMat.cpp:6
↓ 1 callersFunctionfindLongestIncSubLength
Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence.cpp:20
↓ 1 callersMethodfindLongestIncSubLength
(int arr[])
Dynamic Programming/Longest Increasing Subsequence/java/LongestIncreasingSubsequence.java:13
↓ 1 callersFunctionfindMax
Returns index of the maximum element in arr[0..n-1]
Sorting/Pancake Sorting/CPP/pancake_sort.cpp:24
↓ 1 callersFunctionfindMax
Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence.cpp:10
↓ 1 callersMethodfindMax
(int arr[], int n)
Sorting/Pancake Sorting/Java/pancake_sorting.java:26
↓ 1 callersMethodfindMax
(parent *Node)
Tree/Binary Search Tree/go/src/bst.go:58
↓ 1 callersMethodfindMax
(int arr[])
Dynamic Programming/Longest Increasing Subsequence/java/LongestIncreasingSubsequence.java:34
↓ 1 callersFunctionfindMaxSubPath
(integersInMatrix)
Dynamic Programming/Maximum Path Sum in Matrix/max_sum_path.py:11
↓ 1 callersFunctionfindMstKruskal
Graphs/Minimum Spanning Tree/C++/kruskal.cpp:4
↓ 1 callersFunctionfindMstPrim
Graphs/Minimum Spanning Tree/C++/prim.cpp:4
↓ 1 callersFunctionfind_max_crossing_subarray
(A, low, mid, high)
Recursive Algorithms/MaximumSubarray/python/maximum_subarray.py:2
↓ 1 callersFunctionfind_max_crossing_subarray
Recursive Algorithms/MaximumSubarray/cpp/maximum_subarray.cpp:5
↓ 1 callersFunctionfind_max_subarray
(A, low, high)
Recursive Algorithms/MaximumSubarray/python/maximum_subarray.py:17
↓ 1 callersFunctionfind_max_subarray
Recursive Algorithms/MaximumSubarray/cpp/maximum_subarray.cpp:28
↓ 1 callersFunctionfind_maximum_cost
(Y)
Dynamic Programming/Create Maximum Cost List/solution.py:9
↓ 1 callersMethodflipColors
(Node h)
Tree/Red Black BST/RBBST.java:55
↓ 1 callersFunctionfloydWarshall
Solves the all-pairs shortest path problem using Floyd Warshall algorithm
Greedy Algorithms/FloydWarshall-AllPairShortestPath.c:15
↓ 1 callersMethodfloyd_warshall
Graphs/Floyd/Cplusplus/floydWarshall.cpp:38
↓ 1 callersFunctionfordFulkerson
Returns the maximum flow from s to t in the given graph
Greedy Algorithms/ford-fulkerson.cpp:48
↓ 1 callersFunctionfordFulkerson
Returns the maximum flow from s to t in the given graph
Graphs/ford-fulkerson/max_flow.cpp:48
↓ 1 callersMethodfordFulkerson
(int graph[][], int s, int t)
Graphs/FordMaxFlow.java:51
↓ 1 callersFunctionfractional_knapsack
(items, W)
Greedy Algorithms/Fractional Knapsack/python/fractionalKnapsack.py:10
↓ 1 callersFunctionfree_doubly_linked_list
LinkedList/Reverse-DoublyLinkedList/CPP/ReverseDoublyLinkedList.cpp:56
↓ 1 callersFunctionfront
Function to get front of queue
data structures/queue/cpp/queue-implementation.cpp:59
↓ 1 callersFunctiongameOver
A C function that returns True if game has ended and False if game is not yet over
Combinatorial Game Theory/Game of NIM/gameNIM.c:43
↓ 1 callersFunctiongcd
Uses Euclidean algorithm to calculate GCD Takes two numbers
Mathematics/LCM/ruby/lcm.rb:3
↓ 1 callersFunctiongcd
(a int, b int)
Mathematics/LCM/go/lcm.go:7
↓ 1 callersFunctiongcd
(a int, b int)
Mathematics/LCM/go/src/main.go:7
↓ 1 callersFunctiongcd
Mathematics/LCM/CPP/lcm.cpp:3
↓ 1 callersFunctiongcd
(a, b)
Mathematics/GCD/euclidean_algo_GCD_basic.py:3
↓ 1 callersFunctiongcd
Recursive function to return gcd of a and b
Mathematics/GCD/cpp/FindGCD.cpp:6
↓ 1 callersFunctiongcd
(a int, b int)
Mathematics/GCD/go/src/main.go:7
↓ 1 callersFunctiongcd
Graphs/Kosaraju's Algorithm/cpp/strongly-connected-components-kosaraju-algorithm.cpp:39
← previousnext →901–1,000 of 3,327, ranked by callers