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 callersFunctioninsert
LinkedList/C/Doubly_LinkedList/Doubly_Linkedlist.c:8
↓ 1 callersFunctioninsert
data structures/linked list/c/xor linked_list.c:13
↓ 1 callersFunctioninsert
Tree/Binary Search Tree/SumOfKSmallestElements.cpp:21
↓ 1 callersFunctioninsert
Tree/Binary Search Tree/binary_tree_mirror.cpp:10
↓ 1 callersFunctioninsert
Tree/AVLTree/AVL.cpp:61
↓ 1 callersFunctioninsert
inserts the number in the table.
Hashing/Linear Probing/linear_probing.cpp:12
↓ 1 callersMethodinsert
data structures/queue/cpp/CircularQueue.cpp:15
↓ 1 callersMethodinsert
(int n)
data structures/queue/java/queue.java:11
↓ 1 callersMethodinsert
(Object toAdd, int position)
data structures/array/ArrayList.java:15
↓ 1 callersMethodinsert
(self,key)
data structures/trie/python/trie.py:34
↓ 1 callersMethodinsert
(int x)
data structures/linked list/java/Circular Linked List/Circular_LL.java:15
↓ 1 callersMethodinsert
(Tip e)
Tree/Binary Search Tree/bst.java:47
↓ 1 callersMethodinsert
* Inserting Element into the Tree */
Tree/Binary Search Tree/Binary_Search_Tree.cpp:149
↓ 1 callersMethodinsert
Tree/Lowest Common Ancestor/cpp/lowest_common_ancestor.cpp:19
↓ 1 callersMethodinsertAfter
(Node prev_node, int new_data)
data structures/linked list/java/LinkedList.java:30
↓ 1 callersFunctioninsertAfterKey
data structures/linked list/cpp/doubly_circular_linked_list.cpp:119
↓ 1 callersFunctioninsertBeforeKey
data structures/linked list/cpp/doubly_circular_linked_list.cpp:88
↓ 1 callersMethodinsertEdge
(self, u, v, w=0)
Graphs/Bellman-ford/python/bellman.py:16
↓ 1 callersFunctioninsertEnd
data structures/linked list/cpp/doubly_circular_linked_list.cpp:73
↓ 1 callersFunctioninsertFront
data structures/linked list/cpp/doubly_circular_linked_list.cpp:58
↓ 1 callersMethodinsertLeaf
(Tip e, ElementBST node)
Tree/Binary Search Tree/bst.java:55
↓ 1 callersFunctioninsertList
Sorting/Merge Sort/C++/mergeSort_linked_list.cpp:28
↓ 1 callersFunctioninsertNode_bet
data structures/linked list/c/SinglyLinkedList.c:26
↓ 1 callersFunctioninsertNode_bet
data structures/linked list/c/DoublyLinkedList.c:29
↓ 1 callersFunctioninsertNode_end
data structures/linked list/c/SinglyLinkedList.c:49
↓ 1 callersFunctioninsertNode_end
data structures/linked list/c/DoublyLinkedList.c:53
↓ 1 callersMethodinsertRec
(Node root, int key)
Graphs/BinaryTree/java/binaryTree.java:28
↓ 1 callersFunctioninsert_beg
data structures/linked list/cpp/linked-list(doubly-singly).cpp:258
↓ 1 callersFunctioninsert_beg_d
data structures/linked list/cpp/linked-list(doubly-singly).cpp:33
↓ 1 callersFunctioninsert_end
data structures/linked list/cpp/linked-list(doubly-singly).cpp:280
↓ 1 callersFunctioninsert_end_d
data structures/linked list/cpp/linked-list(doubly-singly).cpp:57
↓ 1 callersFunctioninsert_ind
data structures/linked list/cpp/linked-list(doubly-singly).cpp:310
↓ 1 callersFunctioninsert_ind_d
data structures/linked list/cpp/linked-list(doubly-singly).cpp:89
↓ 1 callersFunctioninsert_node
Graphs/BinaryTree/Binary Tree.cpp:21
↓ 1 callersMethodinsert_node
LinkedList/Reverse-DoublyLinkedList/CPP/ReverseDoublyLinkedList.cpp:30
↓ 1 callersFunctioninsertionSort
(arr)
Sorting/Insertion Sort/Python/insertion_sort.py:1
↓ 1 callersFunctioninsertionSort
Sorting/Insertion Sort/C++/insertion_sort.cpp:11
↓ 1 callersFunctioninsertionSort
Sorting/Timsort/C/timsort.c:9
↓ 1 callersMethodinsertionSort2
(int n, int[] arr)
Sorting/Insertion Sort/Java/InsertionSort.java:12
↓ 1 callersFunctioninsertion_sort
(array,n)
Sorting/Insertion Sort/Python/insertion_sort_recursively.py:3
↓ 1 callersFunctioninsertion_sort
(array)
Sorting/Insertion Sort/Ruby/insertion_sort.rb:1
↓ 1 callersFunctioninsertion_sort
(the_array)
Sorting/Timsort/Python/TimSort.py:29
↓ 1 callersMethodinterpolationSearch
(int x)
Searching/Interpolation Search/java/interpolationSearch.java:4
↓ 1 callersMethodinvoke
Searching/binary search/c/test/catch.hpp:8413
↓ 1 callersFunctionirDump
+=============================================================================
Arduino_Code/Arduino-IRremote/irPronto.cpp:481
↓ 1 callersMethodisBalanced
(self, tree)
Tree/Binary Search Tree/bstree.py:216
↓ 1 callersMethodisBinaryExpression
Searching/binary search/c/test/catch.hpp:1951
↓ 1 callersFunctionisEmpty
data structures/stack/c/stack.c:24
↓ 1 callersFunctionisEmpty
Function to check is list is empty
heaps/priority queue/priority_queue.cpp:83
↓ 1 callersMethodisEmpty
(self)
data structures/Graph/GraphDFS(Letters).py:21
↓ 1 callersMethodisEmpty
(Node head)
heaps/priority queue/priority_queue.java:83
↓ 1 callersFunctionisEven
(n)
Bit Manipulation/EvenOrOdd/evenodd.py:1
↓ 1 callersFunctionisEven
Function checks whether the number is even or not. Returns "yes" is N is even, else returns "no". */
Bit Manipulation/EvenOrOdd/evenodd.cpp:10
↓ 1 callersFunctionisFull
data structures/stack/c/stack.c:20
↓ 1 callersFunctionisFull
Queue is full when size becomes equal to the capacity
data structures/queue/cpp/queue-implementation.cpp:27
↓ 1 callersFunctionisFull
data structures/queue/c/queue_using_array.c:28
↓ 1 callersMethodisHidden
Searching/binary search/c/test/catch.hpp:8375
↓ 1 callersFunctionisHoax
(n)
Mathematics/hoaxnumber/python/find_hoaxnumber.py:38
↓ 1 callersMethodisIndexTracker
Searching/binary search/c/test/catch.hpp:6212
↓ 1 callersMethodisLapindrome
(String s)
Other Algorithms/String/java/LapindromeChecker.java:12
↓ 1 callersMethodisLeaf
()
Greedy Algorithms/Huffman/go/huffman.go:32
↓ 1 callersFunctionisMovesLeft
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/tttoptmove.cpp:12
↓ 1 callersFunctionisMovesLeft
Combinatorial Game Theory/Tic-Tac-Toe Optimal Move/Cpp/Tic-Tac-Toe.cpp:12
↓ 1 callersMethodisOpen
Searching/binary search/c/test/catch.hpp:6181
↓ 1 callersFunctionisPalindrome
Other Algorithms/isPalindrome.c:14
↓ 1 callersFunctionisPalindrome
(str)
Other Algorithms/isPalindrome.js:3
↓ 1 callersFunctionisPowerOfTwo
Mathematics/Check Wagstaff Prime/CPP/Wagstaff.cpp:22
↓ 1 callersFunctionisPowerOfTwo
Other Algorithms/Check Wagstaff Prime/Wagstaff.cpp:22
↓ 1 callersFunctionisPrime
Mathematics/Check Wagstaff Prime/CPP/Wagstaff.cpp:5
↓ 1 callersFunctionisPrime
Other Algorithms/isPrime.c:3
↓ 1 callersFunctionisPrime
(value int)
Other Algorithms/isPrime.go:12
↓ 1 callersFunctionisPrime
(number)
Other Algorithms/isPrime.js:4
↓ 1 callersFunctionisPrime
Other Algorithms/Check Wagstaff Prime/Wagstaff.cpp:5
↓ 1 callersFunctionisReservedTag
Searching/binary search/c/test/catch.hpp:8275
↓ 1 callersFunctionisSafe
Backtracking/N-Queens.c:21
↓ 1 callersFunctionisSafe
A utility function to check if i,j are valid indexes for N*N chessboard */
Backtracking/Knight tour problem/c/knight_tour_problem.c:16
↓ 1 callersFunctionisSafe
Returns a boolean which indicates whether it will be legal to assign num to the given row,col location. */
Backtracking/Sudoku solution/C/sudoku.c:94
↓ 1 callersFunctionisSafe
A utility function to check if x,y is valid index for N*N maze */
Backtracking/Rat in a Maze/C/rat_in_a_maze.c:30
↓ 1 callersMethodisSafe
(self, v, colour, c)
Backtracking/mcoloring/mcoloring.py:11
↓ 1 callersMethodisSameSet
Graphs/kruskal/cpp/Kruskal.cpp:34
↓ 1 callersMethodisSet
Searching/binary search/c/test/catch.hpp:4535
↓ 1 callersMethodisSorted
(int[] a)
Sorting/Bogosort/Java/Bogosort.java:32
↓ 1 callersMethodisStackFull
data structures/stack/Kotlin/StackUsingArray.kt:45
↓ 1 callersFunctionisSubSet
Recursive Algorithms/subSetSumRecursive/cpp/subSetSumRecursive.cpp:4
↓ 1 callersFunctionisSubsetSum
(set,n, sum)
Dynamic Programming/sub set sum/python/subSetSum.py:1
↓ 1 callersFunctionisSubsetSum
Dynamic Programming/sub set sum/cpp/Subset-Sum.cpp:9
↓ 1 callersMethodisSubsetSum
(int set[], int n, int sum)
Dynamic Programming/sub set sum/Java/SubSetSum.java:2
↓ 1 callersMethodisSuccessfullyCompleted
Searching/binary search/c/test/catch.hpp:6178
↓ 1 callersMethodis_balanced?
(node=@root)
Tree/Binary Search Tree/Ruby/bst.rb:80
↓ 1 callersFunctionis_palindrome
(x)
Other Algorithms/isPalindrome.py:1
↓ 1 callersFunctionis_power_of_2
Bit Manipulation/power of 2/cpp/power_of_2.cpp:5
↓ 1 callersFunctionis_prime
(x)
Other Algorithms/isPrime.py:1
↓ 1 callersFunctionis_sorted
Sorting/Bogosort/C++/Bogosort.cpp:12
↓ 1 callersFunctionis_sorted
Sorting/Bogosort/C/Bogosort.c:5
↓ 1 callersFunctionjob_Sequencing
Greedy Algorithms/Job_Sequencing.cpp:15
↓ 1 callersFunctionjosephus
* Calcula o sobrevivente no problema de Flavious Josephus * em um circulo de N pessoas e de salto K. * */
Recursive Algorithms/josephus.cpp:15
↓ 1 callersFunctionjump_search
(arr []int, x int)
Searching/Jump Search/go/src/main.go:9
↓ 1 callersFunctionkadane
(a)
Other Algorithms/Kadane Algorithm/python/kadane.py:1
↓ 1 callersFunctionkadane
Other Algorithms/Kadane Algorithm/cpp/kadane.cpp:5
↓ 1 callersFunctionkadane
(a,n)
Dynamic Programming/kadane/python/kadane.py:1
← previousnext →1,101–1,200 of 3,327, ranked by callers