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 callersFunctionkadane
(arr []int64)
Dynamic Programming/kadane/go/kadane.go:8
↓ 1 callersFunctionkaratsuba
Mathematics/Karatsuba/C/karatsuba.c:23
↓ 1 callersFunctionkmp_search
(pat string, text string)
Other Algorithms/KMP/golang/kmp.go:36
↓ 1 callersFunctionknap
(items, max_cost, min_ben, memo)
Dynamic Programming/knapsack/javascript/knapsack.js:64
↓ 1 callersFunctionknapSack
(W , wt , val , n)
Dynamic Programming/knapsack/python/Knapsack.py:6
↓ 1 callersFunctionknapSack
Dynamic Programming/knapsack/C/Knapsack.c:5
↓ 1 callersMethodknapSack
( int W, int wt[], int val[], int n)
Dynamic Programming/knapsack/java/UnboundedKnapsack.java:5
↓ 1 callersFunctionknapsack
Branch And Bound/0_1 Knapsack/CPP/0_1Knapsack.cpp:46
↓ 1 callersFunctionknowWinnerBeforePlaying
Combinatorial Game Theory/Game of NIM/gameNIM.c:165
↓ 1 callersFunctionkosaraju
Graphs/Kosaraju's Algorithm/cpp/strongly-connected-components-kosaraju-algorithm.cpp:82
↓ 1 callersFunctionkruskal
Greedy Algorithms/Kruskal.c:31
↓ 1 callersFunctionksmallestElementSum
Tree/Binary Search Tree/SumOfKSmallestElements.cpp:54
↓ 1 callersFunctionksmallestElementSumRec
Tree/Binary Search Tree/SumOfKSmallestElements.cpp:35
↓ 1 callersFunctionlargest_number
(a)
Greedy Algorithms/Largest Number/largest_number.py:1
↓ 1 callersFunctionlca
Other Algorithms/HeavyLightDecompotion.cpp:96
↓ 1 callersFunctionlca
Graphs/LCA/lca1.cpp:50
↓ 1 callersMethodlca
Tree/Lowest Common Ancestor/cpp/lowest_common_ancestor.cpp:44
↓ 1 callersFunctionlcm
(a int, b int)
Mathematics/LCM/go/lcm.go:16
↓ 1 callersFunctionlcm
(a int, b int)
Mathematics/LCM/go/src/main.go:14
↓ 1 callersFunctionlcm
Mathematics/LCM/CPP/lcm.cpp:9
↓ 1 callersFunctionlcs
(X, Y, m, n)
Recursive Algorithms/LCSRecursive/cpp/LCSREC.py:1
↓ 1 callersFunctionlcs
(X, Y, m, n)
Dynamic Programming/LCSDP/python/lcs.py:1
↓ 1 callersFunctionlcs
Dynamic Programming/common sub sequence/cpp/CommonSubSeq.cpp:7
↓ 1 callersFunctionlcs3
(a, b, c)
Dynamic Programming/Common Subsequence 3/python/longest_common_subsequence_3.py:2
↓ 1 callersFunctionlcs3
Dynamic Programming/Common Subsequence 3/cpp/longest_common_subsequence_3.cpp:5
↓ 1 callersMethodlcsBottomUp
(String s1, String s2, int m, int n)
Dynamic Programming/LCSDP/Java/LCS.java:34
↓ 1 callersFunctionleast
data structures/trie/c/AVL.c:10
↓ 1 callersFunctionleast
data structures/trie/c/BST.c:10
↓ 1 callersFunctionleftRotate
Bit Manipulation/rotate/cpp/rotate-bits-of-n.cpp:5
↓ 1 callersFunctionleftshift
Graphs/BinaryTree/Binary Tree.cpp:39
↓ 1 callersMethodlegal
(int i, int j, int val, int[][] cells)
Backtracking/Sudoku solution/Java/Sudoku.java:32
↓ 1 callersMethodlegal_move
Determines if given move is legal
Recursive Algorithms/minimax/tic-tac-toe/tictactoe.py:36
↓ 1 callersFunctionlevelOrderTraversal
Tree/Traverals/CPP/levelOrder.cpp:12
↓ 1 callersFunctionlimpar
Cleans the tree.
data structures/Red Black/CPP/arvore_rb_c.cpp:388
↓ 1 callersFunctionlinearSearch
Searching/Linear Search/Linearsearch.kt:1
↓ 1 callersFunctionlinear_search
(v : &Vec<i32>, value : i32)
Searching/Linear Search/linear_search.rs:1
↓ 1 callersFunctionlinear_search
Linear Search: it searchs a value by going accross the array
Searching/Linear Search/ruby/linearSearch.rb:2
↓ 1 callersFunctionlis
(arr []int64)
Dynamic Programming/Longest Increasing Subsequence/go/longestIncreasingSubsequence.go:8
↓ 1 callersFunctionlistMerge
Sorting/Merge Sort/C++/mergeSort_linked_list.cpp:41
↓ 1 callersFunctionlistReporters
Searching/binary search/c/test/catch.hpp:5993
↓ 1 callersMethodlistReporters
Searching/binary search/c/test/catch.hpp:4059
↓ 1 callersFunctionlistTags
Searching/binary search/c/test/catch.hpp:5949
↓ 1 callersMethodlistTags
Searching/binary search/c/test/catch.hpp:4058
↓ 1 callersFunctionlistTests
Searching/binary search/c/test/catch.hpp:5863
↓ 1 callersMethodlistTests
Searching/binary search/c/test/catch.hpp:4056
↓ 1 callersFunctionlistTestsNamesOnly
Searching/binary search/c/test/catch.hpp:5909
↓ 1 callersMethodload_factor
data structures/hash/hashfunctions.cpp:177
↓ 1 callersMethodlog2
(int n)
Mathematics/log 2 n/log2n.java:6
↓ 1 callersFunctionlogFunctionParameters
Arduino_Code/Arduino-IRremote/ir_Lego_PF.cpp:22
↓ 1 callersFunctionlongestSuffixPrefix
Other Algorithms/KMP/KMP.cpp:1
↓ 1 callersFunctionlps
Dynamic Programming/LongestPalindromicSubsequence.cpp:4
↓ 1 callersFunctionmagic_squares
(square_size, square=None, used=None, i=0)
Backtracking/Magic Squares/Python/magic_squares.py:31
↓ 1 callersFunctionmain
()
Mathematics/trailing_zeros_in_factorial/trailing_zeros.py:1
↓ 1 callersFunctionmain
()
Sorting/pigeonhole/pigeonhole_sorting.py:29
↓ 1 callersFunctionmain
()
Sorting/ShellSort/python/shell_sort.py:19
↓ 1 callersFunctionmain
()
Sorting/quickSort/python/quick_sort.py:1
↓ 1 callersFunctionmain
()
Sorting/Bubble Sort/Python/bubble_sort.py:2
↓ 1 callersFunctionmain
()
Sorting/SlowSort/python/SlowSort.py:19
↓ 1 callersFunctionmain
()
Other Algorithms/isPalindrome.py:8
↓ 1 callersFunctionmain
()
Other Algorithms/isPrime.py:12
↓ 1 callersFunctionmain
()
Other Algorithms/AStar/astar.py:94
↓ 1 callersFunctionmain
()
Greedy Algorithms/Fractional Knapsack/python/fractionalKnapsack.py:32
↓ 1 callersFunctionmain
()
data structures/trie/python/trie.py:68
↓ 1 callersFunctionmain
()
Tree/Binary Search Tree/bstree.py:290
↓ 1 callersFunctionmain
()
Graphs/A star pathfinding algorithm/Astar.py:109
↓ 1 callersFunctionmain
()
Dynamic Programming/Maximum Path Sum in Matrix/max_sum_path.py:47
↓ 1 callersFunctionmain
()
Dynamic Programming/Create Maximum Cost List/solution.py:25
↓ 1 callersMethodmain
(String[] args)
Sorting/Bogosort/Java/Bogosort.java:48
↓ 1 callersMethodmain
(String[] args)
Other Algorithms/String/java/ReverseString.java:5
↓ 1 callersMethodmain
(String args[])
data structures/queue/java/queue.java:53
↓ 1 callersFunctionmakeBFS
Graphs/check bipartite/cpp/CheckBipartite.cpp:13
↓ 1 callersFunctionmakeCommandLineParser
Searching/binary search/c/test/catch.hpp:5242
↓ 1 callersFunctionmakeData
(amount)
data structures/Graph/GraphDFS(Letters).py:34
↓ 1 callersMethodmakeInferred
(String s)
AI Forward Chaining Resolution/ForwardChaining.java:66
↓ 1 callersFunctionmakeMove
A C function to make moves of the Nim Game
Combinatorial Game Theory/Game of NIM/gameNIM.c:74
↓ 1 callersFunctionmakeNewDLLNode
data structures/linked list/c/linked list.c:86
↓ 1 callersFunctionmakeNewSLLNode
data structures/linked list/c/linked list.c:18
↓ 1 callersFunctionmakeReporter
Searching/binary search/c/test/catch.hpp:7044
↓ 1 callersFunctionmakeTree
(inT,posT,level)
Graphs/BinaryTree/python/binaryTreeFromInfixNPrefix.py:4
↓ 1 callersMethodmarkAsNeedingAnotherRun
Searching/binary search/c/test/catch.hpp:6257
↓ 1 callersFunctionmatrixPower
data structures/Matrix/cpp/matrix_multiply.cpp:22
↓ 1 callersFunctionmax
Dynamic Programming/GameStrategy/game.cpp:7
↓ 1 callersFunctionmaxSlidingWindow
finds the maximum element in the array for every window of size k
data structures/array/sliding_window_maximum.cpp:5
↓ 1 callersFunctionmaxSubArraySum
Dynamic Programming/max_subarray_sum.cpp:11
↓ 1 callersMethodmaxSubArraySum
(int a[], int size)
Other Algorithms/Kadane Algorithm/java/Kadane.java:3
↓ 1 callersFunctionmaxSubseq
Recursive Algorithms/MaximumSubarray/C/MaxSubArrray.c:6
↓ 1 callersMethodmaxValue
(self, tree)
Tree/Binary Search Tree/bstree.py:243
↓ 1 callersFunctionmax_subarray_sum2
Time Complexity = O(n) Space Complexity = O(1) Space Complexity can be reduced by thinking that we really don't need to store all the values of f[i]
Dynamic Programming/kadane/C/kadane.c:39
↓ 1 callersMethodmaximum
Tree/AVLTree/AVL.cpp:287
↓ 1 callersMethodmember
(Tip e)
Tree/Binary Search Tree/bst.java:31
↓ 1 callersFunctionmerge
Takes two sorted lists and returns a single sorted list by comparing the elements one at a time. [1, 2, 3, 4, 5, 6]
Sorting/Timsort/Python/TimSort.py:37
↓ 1 callersFunctionmerge
(left, right)
Sorting/Merge Sort/Javascript/merge_sort.js:19
↓ 1 callersFunctionmerge
First subarray is arr[l..m] Second subarray is arr[m+1..r]
Sorting/Merge Sort/C++/merge_sort.cpp:7
↓ 1 callersFunctionmerge
Merge
Sorting/Merge Sort/Go/mergeSort.go:51
↓ 1 callersFunctionmerge
Sorting/Merge Sort/C/merge_sort.c:2
↓ 1 callersMethodmerge
(int arr[], int l, int m, int r)
Sorting/Merge Sort/Java/merge_sort.java:8
↓ 1 callersFunctionmergeNodes
IS CORRECT
Greedy Algorithms/Huffman/cpp/huffmanInCPP.cpp:21
↓ 1 callersFunctionmergeSort
(arr)
Sorting/Merge Sort/Javascript/merge_sort.js:2
↓ 1 callersFunctionmergeSort
Merge Sort
Sorting/Merge Sort/Go/mergeSort.go:27
↓ 1 callersFunctionmergeSort
Greedy Algorithms/OptimalStorageOnTapes.c:3
← previousnext →1,201–1,300 of 3,327, ranked by callers