Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/CodersForLife/Data-Structures-Algorithms
/ functions
Functions
242 in github.com/CodersForLife/Data-Structures-Algorithms
⨍
Functions
242
◇
Types & classes
32
↓ 60 callers
Function
print
Sorting/bucketsort.c:17
↓ 17 callers
Method
size
()
Structures/Stack.java:37
↓ 14 callers
Function
max
Structures/LinkedList.cpp:55
↓ 11 callers
Method
size
(self)
Arrays/StackArray.py:24
↓ 10 callers
Function
append
Structures/LinkedList.cpp:19
↓ 9 callers
Method
push
Structures/Queue.h:33
↓ 7 callers
Method
length
()
Structures/LinkedList.java:5
↓ 6 callers
Method
addEdge
Graphs/TopologicalSort.cpp:25
↓ 6 callers
Method
addEdge
(int v, int w)
Graphs/DepthFirstTraversal.java:24
↓ 6 callers
Function
get
Structures/LinkedList.cpp:66
↓ 6 callers
Method
isEmpty
Checks if stack is empty @return true if stack is empty, false in other case
Structures/LinkedLists/StackDLinked.java:25
↓ 6 callers
Method
isEmpty
Checks if queue is empty @return true if queue is empty, false in other case
Structures/LinkedLists/QueueDLinked.java:24
↓ 5 callers
Function
Dijkstra
(Graph, Source)
Graphs/Dijkstra.py:26
↓ 5 callers
Method
print
Structures/Queue.h:67
↓ 4 callers
Function
clear
Structures/LinkedList.cpp:39
↓ 4 callers
Method
pop
Structures/Queue.h:46
↓ 3 callers
Method
enqueue
Enqueue an element @param elem The element to be enqueued
Structures/LinkedLists/QueueDLinked.java:33
↓ 3 callers
Method
getSize
Gets the stack size @return int with the stack size
Structures/LinkedLists/StackDLinked.java:63
↓ 3 callers
Method
getSize
Gets the queue size @return int with the queue size
Structures/LinkedLists/QueueDLinked.java:62
↓ 3 callers
Method
pop
(self)
Arrays/StackArray.py:16
↓ 3 callers
Method
push
(self, item)
Arrays/StackArray.py:12
↓ 3 callers
Method
push
Pushes an element @param elem The element to be pushed
Structures/LinkedLists/StackDLinked.java:34
↓ 3 callers
Method
swap
(int[] arr, int i, int j)
Sorting/QuickSort.java:33
↓ 2 callers
Method
dequeue
Dequeue an element @return elem dequeued, null if queue is empty
Structures/LinkedLists/QueueDLinked.java:46
↓ 2 callers
Function
find
Graphs/DSU.cpp:4
↓ 2 callers
Function
find
Graphs/Kruskal.cpp:18
↓ 2 callers
Method
insertAtTail
(int value)
Structures/LinkedList.java:66
↓ 2 callers
Method
isEmpty
(self)
Arrays/StackArray.py:9
↓ 2 callers
Method
isEmpty
(self)
Arrays/QueueArray.py:9
↓ 2 callers
Method
linerSearch
(int[] arr, int key)
Searching/LinearSearch.java:3
↓ 2 callers
Method
pop
Pops an element @return elem popped, null if stack is empty
Structures/LinkedLists/StackDLinked.java:47
↓ 2 callers
Method
printHeap
Sorting/Heapsort.cpp:85
↓ 2 callers
Method
printQueue
Prints the queue on standard output
Structures/LinkedLists/QueueDLinked.java:75
↓ 2 callers
Method
printStack
Prints the stack on standard output
Structures/LinkedLists/StackDLinked.java:76
↓ 2 callers
Function
sort
Graphs/Kruskal.cpp:79
↓ 1 callers
Method
DFS
(int v)
Graphs/DepthFirstTraversal.java:47
↓ 1 callers
Method
DFSUtil
(int v,boolean visited[])
Graphs/DepthFirstTraversal.java:30
↓ 1 callers
Method
Dijkstra
Dijkstra/Dijkstra.cpp.cpp:53
↓ 1 callers
Method
MST
Graphs/Prim.cpp:124
↓ 1 callers
Function
Partition
Sorting/quicksort.cpp:4
↓ 1 callers
Function
Quicksort
Sorting/quicksort.cpp:27
↓ 1 callers
Function
Union
Graphs/Kruskal.cpp:26
↓ 1 callers
Method
addEdge
Graphs/Prim.cpp:101
↓ 1 callers
Method
addEdge
Dijkstra/Dijkstra.cpp.cpp:23
↓ 1 callers
Function
bfs
array to keep record of visited nodes
Graphs/BFS.cpp:7
↓ 1 callers
Function
binarySearch
Searching/Binary-Search.c:3
↓ 1 callers
Function
binarySearch
(arr, l, r, x)
Searching/BinarySearch.py:2
↓ 1 callers
Function
binarySearch
(array, targetValue)
Searching/BinarySearch.js:1
↓ 1 callers
Function
binarySearch
Searching/Binary-Search.cpp:4
↓ 1 callers
Method
binarySearch
(int arr[], int num, int startIndex, int endIndex)
Searching/BinarySearch.java:6
↓ 1 callers
Function
bubbleSort
(arrayItem []int)
Sorting/bubblesort.go:7
↓ 1 callers
Function
bubbleSort
(array)
Sorting/Bubblesort.js:12
↓ 1 callers
Method
bubbleSort
(int[] arr)
Sorting/BubbleSort.java:5
↓ 1 callers
Function
bucketSort
Sorting/bucketsort.c:60
↓ 1 callers
Function
build
Segment Tree/SegmentTree.cpp:59
↓ 1 callers
Method
checkNotNull
(int[] arr)
Bit manipulation/NumberSwapper.java:51
↓ 1 callers
Method
checkState
(int[] arr)
Bit manipulation/NumberSwapper.java:57
↓ 1 callers
Function
countNumberOfComponents
Graphs/DSU.cpp:16
↓ 1 callers
Method
deleteAtPos
(int k)
Structures/LinkedList.java:104
↓ 1 callers
Method
dequeue
(self)
Arrays/QueueArray.py:16
↓ 1 callers
Function
dfs
Graphs/DFS.cpp:26
↓ 1 callers
Method
enqueue
(self, item)
Arrays/QueueArray.py:12
↓ 1 callers
Function
erasing_elements
Structures/LinkedList.cpp:137
↓ 1 callers
Function
exp_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 callers
Function
fourSum
Arrays/FourSum.cpp:6
↓ 1 callers
Function
generateSlice
Generates a slice of random numbers of size specified at line 12
Sorting/quicksort.go:19
↓ 1 callers
Function
get_returns_element_in_position
Structures/LinkedList.cpp:126
↓ 1 callers
Method
heapSort
Sorting/Heapsort.cpp:75
↓ 1 callers
Function
initialize
Graphs/DFS.cpp:38
↓ 1 callers
Function
inserir
Sorting/bucketsort.c:34
↓ 1 callers
Method
insert
Sorting/Heapsort.cpp:28
↓ 1 callers
Method
insertAtHead
(int value)
Structures/LinkedList.java:52
↓ 1 callers
Function
insertionSort
Function to sort an array using insertion sort*/
Sorting/Insertion_Sort.cpp:6
↓ 1 callers
Function
insertionSort
Sorting/Insertionsort.cpp:5
↓ 1 callers
Function
insertion_sort
(Arr)
Sorting/Insertion_sort.py:2
↓ 1 callers
Method
isEmpty
()
Structures/Stack.java:21
↓ 1 callers
Function
isPowerOfTwo
Bit manipulation/powerOfTwo.js:1
↓ 1 callers
Function
isPowerOfTwo
Bit manipulation/powerOfTwo.cpp:3
↓ 1 callers
Function
largestRectangleArea
Arrays/LargestRectangleInHistogram.cpp:6
↓ 1 callers
Function
ler
Sorting/bucketsort.c:8
↓ 1 callers
Function
linearSearch
(array, targetValue)
Searching/LinearSearch.js:1
↓ 1 callers
Function
linearSearch
(list, targetValue)
Searching/LinearSearch.py:1
↓ 1 callers
Function
main
()
Searching/LinearSearch.js:11
↓ 1 callers
Function
main
()
Searching/BinarySearch.js:24
↓ 1 callers
Function
main
()
Searching/LinearSearch.py:8
↓ 1 callers
Function
make_lps
String Matching/KMP.cpp:4
↓ 1 callers
Function
make_set
Graphs/Kruskal.cpp:12
↓ 1 callers
Function
match
String Matching/KMP.cpp:20
↓ 1 callers
Function
maxSubarraySum
Arrays/MaxSubarraySum.cpp:6
↓ 1 callers
Function
max_of_one_element_is_same_element
Structures/LinkedList.cpp:110
↓ 1 callers
Function
max_of_three_elements
Structures/LinkedList.cpp:117
↓ 1 callers
Function
merge
Sorting/mergesort.cpp:4
↓ 1 callers
Function
merge
(left, right)
Sorting/MergeSort.js:3
↓ 1 callers
Function
merge
Graphs/Kruskal.cpp:90
↓ 1 callers
Method
merge
(int[] arr, int leftIndex, int midIndex, int rightIndex)
Sorting/MergeSort.java:19
↓ 1 callers
Function
mergeSort
(arr)
Sorting/MergeSort.js:24
↓ 1 callers
Function
mergeSort
Sorting/mergesort.c:7
↓ 1 callers
Function
mergesort
Sorting/mergesort.cpp:52
↓ 1 callers
Function
partition
(arr, left_index, right_index)
Sorting/Quick_sort.py:8
↓ 1 callers
Method
partition
(int[] arr, int leftIndex, int rightIndex)
Sorting/QuickSort.java:18
next →
1–100 of 242, ranked by callers