MCPcopy Create free account

hub / github.com/CodersForLife/Data-Structures-Algorithms / functions

Functions242 in github.com/CodersForLife/Data-Structures-Algorithms

↓ 60 callersFunctionprint
Sorting/bucketsort.c:17
↓ 17 callersMethodsize
()
Structures/Stack.java:37
↓ 14 callersFunctionmax
Structures/LinkedList.cpp:55
↓ 11 callersMethodsize
(self)
Arrays/StackArray.py:24
↓ 10 callersFunctionappend
Structures/LinkedList.cpp:19
↓ 9 callersMethodpush
Structures/Queue.h:33
↓ 7 callersMethodlength
()
Structures/LinkedList.java:5
↓ 6 callersMethodaddEdge
Graphs/TopologicalSort.cpp:25
↓ 6 callersMethodaddEdge
(int v, int w)
Graphs/DepthFirstTraversal.java:24
↓ 6 callersFunctionget
Structures/LinkedList.cpp:66
↓ 6 callersMethodisEmpty
Checks if stack is empty @return true if stack is empty, false in other case
Structures/LinkedLists/StackDLinked.java:25
↓ 6 callersMethodisEmpty
Checks if queue is empty @return true if queue is empty, false in other case
Structures/LinkedLists/QueueDLinked.java:24
↓ 5 callersFunctionDijkstra
(Graph, Source)
Graphs/Dijkstra.py:26
↓ 5 callersMethodprint
Structures/Queue.h:67
↓ 4 callersFunctionclear
Structures/LinkedList.cpp:39
↓ 4 callersMethodpop
Structures/Queue.h:46
↓ 3 callersMethodenqueue
Enqueue an element @param elem The element to be enqueued
Structures/LinkedLists/QueueDLinked.java:33
↓ 3 callersMethodgetSize
Gets the stack size @return int with the stack size
Structures/LinkedLists/StackDLinked.java:63
↓ 3 callersMethodgetSize
Gets the queue size @return int with the queue size
Structures/LinkedLists/QueueDLinked.java:62
↓ 3 callersMethodpop
(self)
Arrays/StackArray.py:16
↓ 3 callersMethodpush
(self, item)
Arrays/StackArray.py:12
↓ 3 callersMethodpush
Pushes an element @param elem The element to be pushed
Structures/LinkedLists/StackDLinked.java:34
↓ 3 callersMethodswap
(int[] arr, int i, int j)
Sorting/QuickSort.java:33
↓ 2 callersMethoddequeue
Dequeue an element @return elem dequeued, null if queue is empty
Structures/LinkedLists/QueueDLinked.java:46
↓ 2 callersFunctionfind
Graphs/DSU.cpp:4
↓ 2 callersFunctionfind
Graphs/Kruskal.cpp:18
↓ 2 callersMethodinsertAtTail
(int value)
Structures/LinkedList.java:66
↓ 2 callersMethodisEmpty
(self)
Arrays/StackArray.py:9
↓ 2 callersMethodisEmpty
(self)
Arrays/QueueArray.py:9
↓ 2 callersMethodlinerSearch
(int[] arr, int key)
Searching/LinearSearch.java:3
↓ 2 callersMethodpop
Pops an element @return elem popped, null if stack is empty
Structures/LinkedLists/StackDLinked.java:47
↓ 2 callersMethodprintHeap
Sorting/Heapsort.cpp:85
↓ 2 callersMethodprintQueue
Prints the queue on standard output
Structures/LinkedLists/QueueDLinked.java:75
↓ 2 callersMethodprintStack
Prints the stack on standard output
Structures/LinkedLists/StackDLinked.java:76
↓ 2 callersFunctionsort
Graphs/Kruskal.cpp:79
↓ 1 callersMethodDFS
(int v)
Graphs/DepthFirstTraversal.java:47
↓ 1 callersMethodDFSUtil
(int v,boolean visited[])
Graphs/DepthFirstTraversal.java:30
↓ 1 callersMethodDijkstra
Dijkstra/Dijkstra.cpp.cpp:53
↓ 1 callersMethodMST
Graphs/Prim.cpp:124
↓ 1 callersFunctionPartition
Sorting/quicksort.cpp:4
↓ 1 callersFunctionQuicksort
Sorting/quicksort.cpp:27
↓ 1 callersFunctionUnion
Graphs/Kruskal.cpp:26
↓ 1 callersMethodaddEdge
Graphs/Prim.cpp:101
↓ 1 callersMethodaddEdge
Dijkstra/Dijkstra.cpp.cpp:23
↓ 1 callersFunctionbfs
array to keep record of visited nodes
Graphs/BFS.cpp:7
↓ 1 callersFunctionbinarySearch
Searching/Binary-Search.c:3
↓ 1 callersFunctionbinarySearch
(arr, l, r, x)
Searching/BinarySearch.py:2
↓ 1 callersFunctionbinarySearch
(array, targetValue)
Searching/BinarySearch.js:1
↓ 1 callersFunctionbinarySearch
Searching/Binary-Search.cpp:4
↓ 1 callersMethodbinarySearch
(int arr[], int num, int startIndex, int endIndex)
Searching/BinarySearch.java:6
↓ 1 callersFunctionbubbleSort
(arrayItem []int)
Sorting/bubblesort.go:7
↓ 1 callersFunctionbubbleSort
(array)
Sorting/Bubblesort.js:12
↓ 1 callersMethodbubbleSort
(int[] arr)
Sorting/BubbleSort.java:5
↓ 1 callersFunctionbucketSort
Sorting/bucketsort.c:60
↓ 1 callersFunctionbuild
Segment Tree/SegmentTree.cpp:59
↓ 1 callersMethodcheckNotNull
(int[] arr)
Bit manipulation/NumberSwapper.java:51
↓ 1 callersMethodcheckState
(int[] arr)
Bit manipulation/NumberSwapper.java:57
↓ 1 callersFunctioncountNumberOfComponents
Graphs/DSU.cpp:16
↓ 1 callersMethoddeleteAtPos
(int k)
Structures/LinkedList.java:104
↓ 1 callersMethoddequeue
(self)
Arrays/QueueArray.py:16
↓ 1 callersFunctiondfs
Graphs/DFS.cpp:26
↓ 1 callersMethodenqueue
(self, item)
Arrays/QueueArray.py:12
↓ 1 callersFunctionerasing_elements
Structures/LinkedList.cpp:137
↓ 1 callersFunctionexp_by_squaring
Exponentiation by squaring base ^ power can be written as: if power is even: base ^ power = base ^ (power / 2) * base ^ (power / 2) if power is odd: b
Elemental algorithms/exponentiation.cpp:9
↓ 1 callersFunctionfourSum
Arrays/FourSum.cpp:6
↓ 1 callersFunctiongenerateSlice
Generates a slice of random numbers of size specified at line 12
Sorting/quicksort.go:19
↓ 1 callersFunctionget_returns_element_in_position
Structures/LinkedList.cpp:126
↓ 1 callersMethodheapSort
Sorting/Heapsort.cpp:75
↓ 1 callersFunctioninitialize
Graphs/DFS.cpp:38
↓ 1 callersFunctioninserir
Sorting/bucketsort.c:34
↓ 1 callersMethodinsert
Sorting/Heapsort.cpp:28
↓ 1 callersMethodinsertAtHead
(int value)
Structures/LinkedList.java:52
↓ 1 callersFunctioninsertionSort
Function to sort an array using insertion sort*/
Sorting/Insertion_Sort.cpp:6
↓ 1 callersFunctioninsertionSort
Sorting/Insertionsort.cpp:5
↓ 1 callersFunctioninsertion_sort
(Arr)
Sorting/Insertion_sort.py:2
↓ 1 callersMethodisEmpty
()
Structures/Stack.java:21
↓ 1 callersFunctionisPowerOfTwo
Bit manipulation/powerOfTwo.js:1
↓ 1 callersFunctionisPowerOfTwo
Bit manipulation/powerOfTwo.cpp:3
↓ 1 callersFunctionlargestRectangleArea
Arrays/LargestRectangleInHistogram.cpp:6
↓ 1 callersFunctionler
Sorting/bucketsort.c:8
↓ 1 callersFunctionlinearSearch
(array, targetValue)
Searching/LinearSearch.js:1
↓ 1 callersFunctionlinearSearch
(list, targetValue)
Searching/LinearSearch.py:1
↓ 1 callersFunctionmain
()
Searching/LinearSearch.js:11
↓ 1 callersFunctionmain
()
Searching/BinarySearch.js:24
↓ 1 callersFunctionmain
()
Searching/LinearSearch.py:8
↓ 1 callersFunctionmake_lps
String Matching/KMP.cpp:4
↓ 1 callersFunctionmake_set
Graphs/Kruskal.cpp:12
↓ 1 callersFunctionmatch
String Matching/KMP.cpp:20
↓ 1 callersFunctionmaxSubarraySum
Arrays/MaxSubarraySum.cpp:6
↓ 1 callersFunctionmax_of_one_element_is_same_element
Structures/LinkedList.cpp:110
↓ 1 callersFunctionmax_of_three_elements
Structures/LinkedList.cpp:117
↓ 1 callersFunctionmerge
Sorting/mergesort.cpp:4
↓ 1 callersFunctionmerge
(left, right)
Sorting/MergeSort.js:3
↓ 1 callersFunctionmerge
Graphs/Kruskal.cpp:90
↓ 1 callersMethodmerge
(int[] arr, int leftIndex, int midIndex, int rightIndex)
Sorting/MergeSort.java:19
↓ 1 callersFunctionmergeSort
(arr)
Sorting/MergeSort.js:24
↓ 1 callersFunctionmergeSort
Sorting/mergesort.c:7
↓ 1 callersFunctionmergesort
Sorting/mergesort.cpp:52
↓ 1 callersFunctionpartition
(arr, left_index, right_index)
Sorting/Quick_sort.py:8
↓ 1 callersMethodpartition
(int[] arr, int leftIndex, int rightIndex)
Sorting/QuickSort.java:18
next →1–100 of 242, ranked by callers