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
↓ 2 callersFunctionaddtoemptylist
LinkedList/C++/doublyLinkedList.cpp:136
↓ 2 callersMethodadj
(self, u)
Graphs/bfs/python/bfs.py:12
↓ 2 callersMethodadj
(self, u)
Graphs/bfs/python/bfs.py:56
↓ 2 callersMethodallPassed
Searching/binary search/c/test/catch.hpp:2368
↓ 2 callersMethodappend
(...elements)
data structures/linked list/javascript/linkedList.js:27
↓ 2 callersFunctionarmstrongNumber
(num)
Mathematics/Armstrong_no/javascript/armstrong.js:7
↓ 2 callersFunctionbegdel
Function to delete at beginning
LinkedList/C/linkedList.c:82
↓ 2 callersFunctionbegins
Function to insert at beginning
LinkedList/C/linkedList.c:12
↓ 2 callersMethodbest_move
(self, game)
Recursive Algorithms/minimax/tic-tac-toe/tictactoe.py:191
↓ 2 callersMethodbfs
(self, start)
Graphs/bfs/python/bfs.py:24
↓ 2 callersMethodbinarySearch
(int arr[], int l, int r, int x)
Searching/binary search/java/BinarySearchRe.java:6
↓ 2 callersFunctionbogosort
Sorting/Bogosort/C/Bogosort.c:24
↓ 2 callersFunctionbound
Branch And Bound/0_1 Knapsack/CPP/0_1Knapsack.cpp:23
↓ 2 callersFunctionbuildMaxHeap
(arr)
Sorting/Heapsort/Javascript/heapsort.js:49
↓ 2 callersFunctioncalculateNimSum
A C function to calculate the Nim-Sum at any point of the game.
Combinatorial Game Theory/Game of NIM/gameNIM.c:65
↓ 2 callersMethodcaseSensitivitySuffix
Searching/binary search/c/test/catch.hpp:9410
↓ 2 callersMethodcompleteCycle
Searching/binary search/c/test/catch.hpp:6122
↓ 2 callersMethodcompletedCycle
Searching/binary search/c/test/catch.hpp:6126
↓ 2 callersFunctioncountSort
Count sort of arr[].
Sorting/Radix Sort/C++/radix_sort.cpp:16
↓ 2 callersFunctioncounting_sort
Counting sort `arr` - Collection of value to be sorted in place. `min` - Lower bound of the integer range. `max` - Upper bound of the integer range. `
Sorting/Counting Sort/Rust/counting-sort.rs:11
↓ 2 callersMethodcounting_sort
Sorting/Counting Sort/Ruby/countSort.rb:6
↓ 2 callersFunctioncreateNode
Graphs/dfs/c/dfs.c:50
↓ 2 callersMethoddelete
(Tip e)
Tree/Binary Search Tree/bst.java:51
↓ 2 callersMethoddequeue
(self)
data structures/queue/python/queue.py:9
↓ 2 callersFunctiondfs
Graphs/Kosaraju ALgorithm/Kosaraju_ALgorithm.cpp:46
↓ 2 callersFunctiondfs
(actual int)
Graphs/dfs/go/dfs.go:10
↓ 2 callersFunctiondijkstra
(edges, f, t)
Graphs/Dijkstra Algorithm/python/Dijkastra's_algo.py:4
↓ 2 callersFunctiondisplay
displaying the elements of the list
LinkedList/Reverse/Reversal_of_Single_Linked_List/C/iterative_reversal.c:54
↓ 2 callersFunctiondisplay
data structures/linked list/cpp/singly_reversed_linked_list.cpp:28
↓ 2 callersMethoddisplay
()
data structures/queue/java/queue.java:40
↓ 2 callersMethoddisplay
()
Tree/segment tree/Java/SegmentTree.java:35
↓ 2 callersFunctiondisplayDLL
data structures/linked list/c/linked list.c:150
↓ 2 callersFunctiondisplaySLL
data structures/linked list/c/linked list.c:77
↓ 2 callersFunctiondown_adjust
Sorting/Heapsort/C/Heapsort.c:45
↓ 2 callersMethodendExpression
Searching/binary search/c/test/catch.hpp:9210
↓ 2 callersFunctionenqueue
Graphs/bfs/c/bfs.c:120
↓ 2 callersMethodensureTagClosed
Searching/binary search/c/test/catch.hpp:10180
↓ 2 callersFunctionexpo
Mathematics/modular exp/cpp/modular_exp.cpp:8
↓ 2 callersFunctionfactorial
(num)
Mathematics/factorial/python/factorial.py:3
↓ 2 callersFunctionfibonacci
Dynamic Programming/fibonacci/cpp/fibonacci.cpp:4
↓ 2 callersFunctionfind
Other Algorithms/union_find/union_find.cpp:15
↓ 2 callersFunctionfind
Greedy Algorithms/Kruskal.c:61
↓ 2 callersMethodfind
data structures/hash/hashfunctions.cpp:129
↓ 2 callersMethodfindChild
Searching/binary search/c/test/catch.hpp:6192
↓ 2 callersFunctionfindTurnAroundTime
Scheduling/FCFS/fcfs.cpp:31
↓ 2 callersFunctionfindWaitingTime
Scheduling/FCFS/fcfs.cpp:24
↓ 2 callersMethodfind_top
()
heaps/BinomialHeap/Go/binomial_heap.go:103
↓ 2 callersFunctionfindavgTime
Scheduling/FCFS/fcfs.cpp:36
↓ 2 callersMethodflatten
Tree/Binary Tree to Linked List/cpp/BinaryTreeToLinkedList.cpp:36
↓ 2 callersFunctionflip
Reverses arr[0..i] */
Sorting/Pancake Sorting/php/pancake_sort.php:7
↓ 2 callersFunctionflip
Reverses arr[0..i] */
Sorting/Pancake Sorting/CPP/pancake_sort.cpp:8
↓ 2 callersFunctionflip
Flip
Sorting/Pancake Sorting/Go/pancakeSort.go:44
↓ 2 callersMethodflip
(int arr[], int i)
Sorting/Pancake Sorting/Java/pancake_sorting.java:10
↓ 2 callersFunctionfpToString
Searching/binary search/c/test/catch.hpp:9081
↓ 2 callersMethodfullConfig
Searching/binary search/c/test/catch.hpp:5619
↓ 2 callersFunctiongcd
(a,b = None)
Mathematics/GCD/python/gcd.py:4
↓ 2 callersMethodgenerateEdges
(self)
data structures/Graph/GraphDictionaries.py:38
↓ 2 callersFunctiongenerate_exception
data structures/Matrix/cpp/main.cpp:39
↓ 2 callersFunctiongetAnnotation
Searching/binary search/c/test/catch.hpp:3367
↓ 2 callersMethodgetCurrentTestName
Searching/binary search/c/test/catch.hpp:6837
↓ 2 callersFunctiongetCurrentTicks
Searching/binary search/c/test/catch.hpp:8663
↓ 2 callersMethodgetExpression
Searching/binary search/c/test/catch.hpp:8210
↓ 2 callersFunctiongetFormattedDuration
Because formatting using c++ streams is stateful, drop down to C is required Alternatively we could use stringstream, but its performance is... not go
Searching/binary search/c/test/catch.hpp:9626
↓ 2 callersMethodgetIndexes
** Generate the hashes from the key. Please refer to Less Hashing, Same Performance: Building a Better Bloom Filter (Adam Kirsch, Michael Mitzenmacher
data structures/Bloom Filter/bloomfilter.go:73
↓ 2 callersFunctiongetMax
Get maximum value from array.
Sorting/Radix Sort/C++/radix_sort.cpp:6
↓ 2 callersFunctiongetMax
Dynamic Programming/Longest Increasing Subsequence/cpp/longest_increasing_subsequence_bit.cpp:15
↓ 2 callersMethodgetMin
()
data structures/stack/java/SpecialStack.java:48
↓ 2 callersFunctiongetNode
Returns new trie node (initialized to NULLs)
data structures/trie/cpp/trie.cpp:19
↓ 2 callersFunctiongetNode
Tree/Trie/Trie.cpp:30
↓ 2 callersMethodgetNode
(self)
data structures/trie/python/trie.py:20
↓ 2 callersMethodgetPreferences
Searching/binary search/c/test/catch.hpp:8580
↓ 2 callersFunctiongetSum
Returns sum of arr[0..index]. This function assumes that the array is preprocessed and partial sums of array elements are stored in BITree[].
data structures/Fenwick_Tree.cpp:13
↓ 2 callersMethodgetTime
()
Graphs/Dijkstra Algorithm/Java/Path.java:43
↓ 2 callersFunctiongo
Tree/Heavy Light Decomposition/hld.cpp:77
↓ 2 callersMethodgreedyColoring
Assigns colors (starting from 0) to all vertices and prints the assignment of colors
Greedy Algorithms/graphcolor.cpp:30
↓ 2 callersMethodhasExpandedExpression
Searching/binary search/c/test/catch.hpp:8223
↓ 2 callersFunctionheapSort
main function to do heap sort
Sorting/Heapsort/C++/heapsort.cpp:33
↓ 2 callersFunctionheapify
To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap
Sorting/Heapsort/php/heap_sort.php:7
↓ 2 callersFunctionheapify
(arr, i, max)
Sorting/Heapsort/Javascript/heapsort.js:20
↓ 2 callersFunctionheapify
(arr, n, i)
Sorting/Heapsort/Python/heapsort.py:1
↓ 2 callersFunctionheapify
To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap
Sorting/Heapsort/C++/heapsort.cpp:8
↓ 2 callersFunctionheapify
Builds a max heap in an array with the specified root
Sorting/Heapsort/Ruby/heapsort.rb:2
↓ 2 callersMethodheapify
(int arr[], int n, int i)
Sorting/Heapsort/Java/HeapSort.java:27
↓ 2 callersMethodinOrder
Tree/Binary Tree to Linked List/cpp/BinaryTreeToLinkedList.cpp:70
↓ 2 callersFunctioninorder
Tree/Binary Search Tree/binary_tree_mirror.cpp:27
↓ 2 callersMethodinsert
data structures/hash/hashfunctions.cpp:52
↓ 2 callersMethodinsert
(self, tree, value)
Tree/Binary Search Tree/bstree.py:70
↓ 2 callersMethodinsertEdge
(self, u, v, w=0)
Graphs/bfs/python/bfs.py:16
↓ 2 callersMethodinsertNode
(self, u)
Graphs/bfs/python/bfs.py:49
↓ 2 callersFunctioninsertNode_beg
data structures/linked list/c/SinglyLinkedList.c:17
↓ 2 callersFunctioninsertNode_beg
data structures/linked list/c/DoublyLinkedList.c:19
↓ 2 callersMethodisComplete
Searching/binary search/c/test/catch.hpp:6175
↓ 2 callersFunctionisDebuggerActive
Returns true if the current process is being debugged (either running under the debugger or has a debugger attached post facto).
Searching/binary search/c/test/catch.hpp:8871
↓ 2 callersFunctionisEmpty
data structures/queue/c/queue_using_array.c:23
↓ 2 callersMethodisEmpty
data structures/queue/Kotlin/QueueUsingArray.kt:5
↓ 2 callersFunctionisOk
Searching/binary search/c/test/catch.hpp:883
↓ 2 callersMethodisStackEmpty
data structures/stack/Kotlin/StackUsingArray.kt:42
↓ 2 callersMethodisVertex
(self,vertex)
data structures/Graph/Example/GraphExample.py:58
↓ 2 callersFunctionis_anagram
(str1, str2)
Mathematics/Anagrams/Python/Anagram.py:5
↓ 2 callersFunctionjuggle
(n)
Mathematics/juggler sequence/javascript/juggler_seq.js:4
← previousnext →401–500 of 3,327, ranked by callers