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 callersFunctionpower
Mathematics/modular exp/c/modular-exp.c:3
↓ 1 callersFunctionpower
This function finds power of a number x
Mathematics/Power_For_Huge_Num/Power_Huge.cpp:47
↓ 1 callersMethodpower
(int x, int n)
Mathematics/Power_For_Huge_Num/Power_Huge.java:46
↓ 1 callersFunctionpoweroffour
Bit Manipulation/power of 4/cpp/power_of_4.cpp:18
↓ 1 callersFunctionpreOrder
Tree/AVLTree/AVL.cpp:143
↓ 1 callersFunctionpreOrder
Tree/Traverals/CPP/preOrder.cpp:12
↓ 1 callersFunctionpreOrder
Graphs/BinaryTree/Binary Tree.cpp:49
↓ 1 callersMethodpre_order
(node=@root, &block)
Tree/Binary Search Tree/Ruby/bst.rb:38
↓ 1 callersFunctionprecomputeSparseMatrix
Graphs/LCA/lca.cpp:23
↓ 1 callersMethodpredecessor
Tree/AVLTree/AVL.cpp:276
↓ 1 callersMethodpreorder
* Pre Order Traversal */
Tree/Binary Search Tree/Binary_Search_Tree.cpp:303
↓ 1 callersFunctionpreorderTraversal
function for the preorder traversal of the tree
Tree/Binary Search Tree/Bst to min heap.cpp:83
↓ 1 callersMethodpreorders
()
Tree/Traverals/JAVA/preorder.java:39
↓ 1 callersMethodprepareOddNumbers
()
Other Algorithms/Luhn/luhn.js:52
↓ 1 callersFunctionprimMST
Greedy Algorithms/prims.c:28
↓ 1 callersFunctionprimMST
Function to construct and print MST for a graph represented using adjacency matrix representation
Graphs/Minimum Spanning Tree/C/mst-prims.c:37
↓ 1 callersMethodprimMST
(int graph[][])
Graphs/Minimum Spanning Tree/java/MST.java:39
↓ 1 callersMethodprimMST
(int graph[][])
Graphs/Prims Algorithm/Java/PrimsAlgorithm.java:39
↓ 1 callersFunctionprimeFactors
(n)
Mathematics/hoaxnumber/python/find_hoaxnumber.py:10
↓ 1 callersFunctionprimeFactors
(n)
Mathematics/prime factors/python/prime.py:2
↓ 1 callersFunctionprimeFactors
(n uint64)
Mathematics/prime factors/go/primefactorization.go:3
↓ 1 callersFunctionprime_factors
(n)
Mathematics/prime factors/javascript/prime_factors.js:4
↓ 1 callersFunctionprimefactors
Mathematics/prime factors/cpp/prime_factors.cpp:23
↓ 1 callersFunctionprimsAlgo
(e,c,n)
Graphs/Prims Algorithm/Prims/Prims.py:6
↓ 1 callersMethodprint
data structures/Matrix/cpp/Matrix.h:34
↓ 1 callersFunctionprintArr
Greedy Algorithms/Huffman/cpp/huffmanInCPP.cpp:31
↓ 1 callersFunctionprintArray
A utility function ot print an array of size n
Sorting/Gnome Sort/cppgnome.cpp:23
↓ 1 callersFunctionprintArray
A utility function to print array of size n */
Sorting/Heapsort/php/heap_sort.php:54
↓ 1 callersFunctionprintArray
A utility function to print n array of size n
Sorting/Pancake Sorting/php/pancake_sort.php:70
↓ 1 callersFunctionprintArray
A utility function to print n array of size n
Sorting/Pancake Sorting/CPP/pancake_sort.cpp:71
↓ 1 callersMethodprintArray
(int[] arr)
Sorting/Bogosort/Java/Bogosort.java:41
↓ 1 callersMethodprintArray
(int arr[])
Sorting/Heapsort/Java/HeapSort.java:54
↓ 1 callersMethodprintArray
(int a[])
Sorting/Cocktail/cocktail.java:56
↓ 1 callersMethodprintArray
(int arr[])
Sorting/Merge Sort/Java/merge_sort.java:83
↓ 1 callersMethodprintArray
(int arr[], int arr_size)
Sorting/Pancake Sorting/Java/pancake_sorting.java:71
↓ 1 callersMethodprintBlockchain
(self)
Blockchain/blockchain_algorithm.py:27
↓ 1 callersFunctionprintEgyptian
Greedy Algorithms/egyptian-fraction.cpp:4
↓ 1 callersFunctionprintGolomb
Print the first n term of Golomb Sequence
Dynamic Programming/golomb.cpp:21
↓ 1 callersFunctionprintGraph
Graphs/Minimum Spanning Tree/C++/mst.cpp:98
↓ 1 callersFunctionprintGraph
Graphs/dfs/c/dfs.c:87
↓ 1 callersMethodprintGraph
(self,gtype=None)
data structures/Graph/GraphAL.py:62
↓ 1 callersMethodprintGraph
(self,gtype=None)
data structures/Graph/Example/GraphExample.py:62
↓ 1 callersFunctionprintGrid
A utility function to print grid */
Backtracking/Sudoku solution/C/sudoku.c:104
↓ 1 callersFunctionprintInorder
data structures/trie/c/BST.c:83
↓ 1 callersFunctionprintJuggler
Mathematics/juggler sequence/C/juggler_seq.c:6
↓ 1 callersFunctionprintList
A utility function to print a given linked list
data structures/linked list/cpp/llMiddle.cpp:45
↓ 1 callersFunctionprintList
data structures/linked list/c/SinglyLinkedList.c:89
↓ 1 callersFunctionprintList
data structures/linked list/c/xor linked_list.c:28
↓ 1 callersFunctionprintList
data structures/linked list/c/DoublyLinkedList.c:94
↓ 1 callersMethodprintList
()
LinkedList/Java/LinkedList.java:133
↓ 1 callersMethodprintList
()
data structures/linked list/java/LinkedList.java:83
↓ 1 callersFunctionprintMST
Greedy Algorithms/prims.c:20
↓ 1 callersFunctionprintMST
A utility function to print the constructed MST stored in parent[]
Graphs/Minimum Spanning Tree/C/mst-prims.c:27
↓ 1 callersMethodprintMST
(int parent[], int n, int graph[][])
Graphs/Minimum Spanning Tree/java/MST.java:29
↓ 1 callersMethodprintMST
(int parent[], int n, int graph[][])
Graphs/Prims Algorithm/Java/PrimsAlgorithm.java:29
↓ 1 callersFunctionprintMaxActivities
Greedy Algorithms/Activity Selection/cpp/activity_selection.cpp:16
↓ 1 callersFunctionprintMiddle
Function to get the middle of the linked list*/
data structures/linked list/cpp/llMiddle.cpp:12
↓ 1 callersFunctionprintQueue
Graphs/bfs/c/bfs.c:146
↓ 1 callersFunctionprintSolution
A utility function to print solution */
Greedy Algorithms/FloydWarshall-AllPairShortestPath.c:56
↓ 1 callersFunctionprintSolution
A utility function to print the constructed distance array
Graphs/Dijkstra Algorithm/cpp/dijkstra.cpp:22
↓ 1 callersFunctionprintSolution
Backtracking/N-Queens.c:10
↓ 1 callersFunctionprintSolution
A utility function to print solution matrix sol[N][N] */
Backtracking/Knight tour problem/c/knight_tour_problem.c:23
↓ 1 callersFunctionprintSolution
A utility function to print solution matrix sol[N][N] */
Backtracking/Rat in a Maze/C/rat_in_a_maze.c:19
↓ 1 callersFunctionprintSolution
A utility function to print solution */
Dynamic Programming/BellmanFord-SingleSourceShortestPath.c:56
↓ 1 callersMethodprintSolution
(self, dist)
Graphs/Dijkstra Algorithm/python/dijkstra.py:10
↓ 1 callersMethodprintTree
(self, tree)
Tree/Binary Search Tree/bstree.py:254
↓ 1 callersMethodprintTree
(int size)
Tree/Binary Tree/BinaryTree.java:40
↓ 1 callersMethodprintTree_postOrder
(self, tree)
Tree/Binary Search Tree/bstree.py:272
↓ 1 callersMethodprintTree_preOrder
(self, tree)
Tree/Binary Search Tree/bstree.py:263
↓ 1 callersMethodprintTree_reverseOrder
(self, tree)
Tree/Binary Search Tree/bstree.py:282
↓ 1 callersFunctionprint_arrayay
(array,n)
Sorting/Insertion Sort/Python/insertion_sort_recursively.py:19
↓ 1 callersFunctionprint_cut_rod
(p, n)
Dynamic Programming/Cutting Rod/python/cutting_rod.py:22
↓ 1 callersFunctionprint_cut_rod
Dynamic Programming/Cutting Rod/cpp/cutting_rod.cpp:19
↓ 1 callersFunctionprint_doubly_linked_list
LinkedList/Reverse-DoublyLinkedList/CPP/ReverseDoublyLinkedList.cpp:44
↓ 1 callersMethodprint_in_order
Tree/AVLTree/AVL.cpp:291
↓ 1 callersFunctionprinti
data structures/linked list/cpp/linked-list(doubly-singly).cpp:463
↓ 1 callersFunctionprinti_d
data structures/linked list/cpp/linked-list(doubly-singly).cpp:237
↓ 1 callersFunctionprintt
Prints the node by parameter, does a BFS to print by Level.
data structures/Red Black/CPP/arvore_rb_c.cpp:351
↓ 1 callersFunctionpro
Other Algorithms/HeavyLightDecompotion.cpp:78
↓ 1 callersMethodprocessdata
(String k,int b,int a,int p)
Other Algorithms/Process Scheduling/java/process.java:18
↓ 1 callersFunctionpromptGraphGenerationParams
Graphs/Minimum Spanning Tree/C++/mst.cpp:23
↓ 1 callersFunctionpush
data structures/stack/c/stack_in_c.c:117
↓ 1 callersFunctionpush
data structures/stack/c/stack_using_linkedList.c:12
↓ 1 callersFunctionpush
data structures/linked list/cpp/llMiddle.cpp:28
↓ 1 callersMethodpushScopedMessage
Searching/binary search/c/test/catch.hpp:6829
↓ 1 callersFunctionq1
Tree/AVLTree/AVL.cpp:311
↓ 1 callersFunctionq2
Tree/AVLTree/AVL.cpp:336
↓ 1 callersFunctionqry
Tree/Heavy Light Decomposition/hld.cpp:94
↓ 1 callersFunctionque_del_arr
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:142
↓ 1 callersFunctionque_del_list
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:313
↓ 1 callersFunctionque_ins_arr
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:119
↓ 1 callersFunctionque_ins_list
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:289
↓ 1 callersFunctionque_print
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:159
↓ 1 callersFunctionque_print_list
data structures/stack/cpp/menu-driven-stack-and-queue.cpp:345
↓ 1 callersFunctionquery
Tree/segment tree/cpp/EfficientSingleElementModification.cpp:13
↓ 1 callersFunctionquery
Tree/segment tree/cpp/Inversion Count Segment tree.cpp:14
↓ 1 callersMethodquickSort
(int[] a,int x,int y)
Sorting/quickSort/Java/quick_sort.java:17
↓ 1 callersFunctionquick_Sort
(origArray)
Sorting/quickSort/Javascript/quick_sort.js:1
↓ 1 callersFunctionquick_select
In-place algorithm requires O(1) memory if compiler is tail call optimized selection of pivot is randomized to avoid worst case pivot selection leadin
Selection Algorithms/Quick_Select/cpp/quick_select.cpp:26
↓ 1 callersFunctionquick_sort
(arr: &mut [T])
Sorting/quickSort/Rust/quick-sort.rs:1
← previousnext →1,401–1,500 of 3,327, ranked by callers