MCPcopy Create free account

hub / github.com/Hemant-Jain-Author/Data-Structures-Algorithms-In-Go / functions

Functions1,518 in github.com/Hemant-Jain-Author/Data-Structures-Algorithms-In-Go

⨍ Functions 1,518◇ Types & classes 101
↓ 2 callersMethodArea
()
Basics/Shape.go:22
↓ 2 callersMethodBack
()
Tree/Tree.go:1310
↓ 2 callersFunctionBinarySearch
(data []int, value int)
IntroductoryChapters/Intro.go:52
↓ 2 callersFunctionBinarySearch2
* 30 5 true false true */
Searching/Searching.go:1661
↓ 2 callersFunctionBinarySearchRecursive
(data []int, value int)
IntroductoryChapters/Intro.go:600
↓ 2 callersFunctionBinarySearchRecursive
(data []int, value int)
Searching/Searching.go:47
↓ 2 callersFunctionBinarySearchRotateArray
(data []int, key int)
Searching/Searching.go:1945
↓ 2 callersFunctionBubbleSort
BubbleSort sorts the array using the specified comparison function.
Sorting/BubbleSort.go:16
↓ 2 callersMethodCopyList
()
LinkedLIst/DoublyLinkedList.go:163
↓ 2 callersMethodCopyListReversed
()
LinkedLIst/DoublyLinkedList.go:151
↓ 2 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool)
Graph/GraphAM.go:417
↓ 2 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool)
Graph/hp.go:14
↓ 2 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool)
Graph/Graph.go:1563
↓ 2 callersMethodDelete
(data int)
Tree/RBTree.go:215
↓ 2 callersMethodDelete
(data int)
Tree/SPLAYTree.go:198
↓ 2 callersMethodDeleteNodes
(delValue int)
LinkedLIst/LinkedLIst.go:137
↓ 2 callersFunctionFibonacciSearch
(arr []int, value int)
Searching/Searching.go:65
↓ 2 callersMethodFind
(key int)
HashTable/HashTableLP.go:60
↓ 2 callersMethodFind
(key int)
HashTable/HashTableSC.go:65
↓ 2 callersFunctionFindBitonicArrayMaxIndex
(data []int)
Searching/Searching.go:1617
↓ 2 callersFunctionHeapSort
* Heap size : 10 Heap Array : 10 9 4 8 7 3 1 6 5 2 10 9 8 7 6 5 4 3 2 1 */
Heap/heap2.go:178
↓ 2 callersFunctionHeapSort
* Heap size : 10 Heap Array : 10 9 4 8 7 3 1 6 5 2 10 9 8 7 6 5 4 3 2 1 */
Heap/Heap.go:176
↓ 2 callersFunctionInfixToPostfix
(expn string)
Stack/StackExercise.go:536
↓ 2 callersFunctionIsAnagram
(str1 string, str2 string)
HashTable/HashTableExercise.go:5
↓ 2 callersMethodIsCompleteTree
()
Tree/Tree.go:695
↓ 2 callersMethodIsConnectedUndirected
* Graph is :: Vertex 0 is connected to : 2(cost:1) 1(cost:1) Vertex 1 is connected to : 2(cost:1) Vertex 2 is connected to : 3(cost:1) Vertex 3 i
Graph/Graph.go:789
↓ 2 callersMethodIsEmpty
IsEmpty checks if the heap is empty
AlgorithmsChapters/Greedy/JoinRopes.go:180
↓ 2 callersMethodIsEmpty
()
AlgorithmsChapters/Greedy/ChotaBhim.go:156
↓ 2 callersMethodIsEmpty
()
AlgorithmsChapters/Greedy/OptimalMergePattern.go:119
↓ 2 callersMethodIsEmpty
()
AlgorithmsChapters/Greedy/HuffmanTree.go:162
↓ 2 callersMethodIsEmpty
()
Graph/GraphAM.go:483
↓ 2 callersMethodIsEmpty
()
Graph/Graph.go:1629
↓ 2 callersMethodIsEulerian
()
Graph/Graph.go:989
↓ 2 callersFunctionIsPalindrome
* apple & plepa are permutation IsPermutation: true appleb & plepaa are not permutation IsPermutation: false */
String/StringEx.go:155
↓ 2 callersFunctionIsPermutation
* No duplicate detected! Duplicate detected! */
String/StringEx.go:118
↓ 2 callersFunctionIsPrime
(n int)
AlgorithmsChapters/CA/IsPrime.go:5
↓ 2 callersFunctionIsUniqueChar
* Prime numbers under 10 :: 2 3 5 7 */
String/StringEx.go:93
↓ 2 callersFunctionKMPPreprocess
(pattern string, ShiftArr []int)
String/StringMatching.go:64
↓ 2 callersMethodLen
Len returns the number of elements in the stack.
Queue/QueueUsingStack.go:89
↓ 2 callersMethodLength
Length returns the number of elements in the queue.
Queue/StackUsingQueue.go:125
↓ 2 callersMethodLength
Length returns the number of elements in the queue.
Queue/QueueUsingStack.go:34
↓ 2 callersMethodLoopDetect
()
LinkedLIst/LinkedLIst.go:341
↓ 2 callersFunctionNewNode
(ch rune, fr int, l *Node, r *Node)
AlgorithmsChapters/Greedy/HuffmanTree.go:13
↓ 2 callersFunctionNewNode
(d int, nullNode *Node)
Tree/RBTree.go:24
↓ 2 callersMethodNthNodeFromBegining
(index int)
LinkedLIst/LinkedLIst.go:285
↓ 2 callersMethodPeek
()
LinkedLIst/LinkedLIst.go:35
↓ 2 callersMethodPeek
()
Collections/Heap.go:66
↓ 2 callersMethodPerimeter
()
Basics/Shape.go:26
↓ 2 callersMethodPop
()
Stack/Stack.go:13
↓ 2 callersMethodPop
Pop removes and returns the element at the top of the stack.
Queue/StackUsingQueue.go:18
↓ 2 callersMethodPop
()
Collections/Heap.go:51
↓ 2 callersMethodPop2
Pop2 removes and returns the element at the top of the stack.
Queue/StackUsingQueue.go:36
↓ 2 callersMethodPrint
()
Graph/Graph.go:47
↓ 2 callersFunctionPrintArr
(arr []int, count int)
Sorting/SortingEx.go:9
↓ 2 callersMethodPrintTree
()
Tree/SPLAYTree.go:42
↓ 2 callersMethodPrintTree
()
Tree/BTree.go:39
↓ 2 callersMethodPush
Push adds an element to the top of the stack.
Queue/QueueUsingStack.go:70
↓ 2 callersFunctionQuickSelectUtil
(arr []int, lower int, upper int, k int)
Heap/heap2.go:411
↓ 2 callersFunctionQuickSelectUtil
(arr []int, lower int, upper int, k int)
Heap/Heap.go:396
↓ 2 callersFunctionQuickSelectUtil
(arr []int, lower int, upper int, k int)
Searching/Searching.go:2501
↓ 2 callersMethodRemove
Remove removes and returns the smallest element from the heap
AlgorithmsChapters/Greedy/JoinRopes.go:151
↓ 2 callersMethodRemove
()
AlgorithmsChapters/Greedy/OptimalMergePattern.go:93
↓ 2 callersMethodRemove
()
Graph/GraphAM.go:457
↓ 2 callersMethodRemove
()
Graph/hp.go:54
↓ 2 callersMethodRemove
Remove removes and returns the element at the front of the queue.
Queue/StackUsingQueue.go:93
↓ 2 callersMethodRemove
()
Queue/Queue.go:13
↓ 2 callersMethodRemove
Remove removes and returns the element at the front of the queue.
Queue/QueueLL.go:51
↓ 2 callersMethodRemove
(key interface{})
Collections/Set2.go:13
↓ 2 callersMethodRemoveHead
()
LinkedLIst/DoublyLinkedList.go:59
↓ 2 callersMethodSearch
(key int)
Tree/BTree.go:55
↓ 2 callersFunctionSearchBitonicArray
(data []int, key int)
Searching/Searching.go:1606
↓ 2 callersFunctionSequentialSearch
(data []int, value int)
IntroductoryChapters/Intro.go:42
↓ 2 callersMethodSize
()
Graph/GraphAM.go:487
↓ 2 callersMethodSize
()
Graph/Graph.go:1633
↓ 2 callersFunctionSum
* {1 johny} Student name :: johny Student name :: johny {2 Ann} {2 Ann} {0 Alice} */
Basics/untitled.go:133
↓ 2 callersMethodUpdate
(ind int, val int)
Tree/rmqST.go:40
↓ 2 callersMethodUpdate
(index int, val int)
Tree/BinaryIndexTree.go:23
↓ 2 callersMethodassign
(coeffs []int, pows []int, size int)
LinkedLIst/Polynomial.go:34
↓ 2 callersMethoddfsUtil2
(curr int, visited []bool, stk *Stack)
Graph/Graph.go:122
↓ 2 callersMethodfind
(parent []int, index int)
Graph/Graph.go:506
↓ 2 callersFunctionfindFirstIndex
(data []int, start int, end int, key int)
Searching/Searching.go:1696
↓ 2 callersMethodfindMax
(curr *Node)
Tree/Tree.go:352
↓ 2 callersFunctionfindMaxVal
(maxVal [][]int, i int, j int)
AlgorithmsChapters/DP/MinCostBinaryTree.go:58
↓ 2 callersMethodgetBalance
(node *Node)
Tree/AVLTree.go:33
↓ 2 callersFunctiongetBulbStatus
(bi BulbInterface)
Basics/Bulb.go:57
↓ 2 callersFunctioninsertAtBottom
* Output: [1 2 3 4] */
Stack/StackExercise.go:102
↓ 2 callersFunctionisBSTArray
(preorder []int, size int)
Tree/Tree.go:993
↓ 2 callersMethodisCyclePresent
()
Graph/Graph.go:678
↓ 2 callersMethodisCyclePresentColor
()
Graph/Graph.go:713
↓ 2 callersMethodisCyclePresentUndirected
()
Graph/Graph.go:493
↓ 2 callersMethodisCyclePresentUndirected2
()
Graph/Graph.go:519
↓ 2 callersMethodisCyclePresentUndirected3
()
Graph/Graph.go:587
↓ 2 callersFunctionisEven
(value int)
Basics/switch.go:31
↓ 2 callersMethodisOnFun
()
Basics/Bulb.go:40
↓ 2 callersMethodleftRightRotate
Function to left then right rotate subtree rooted with x
Tree/AVLTree.go:117
↓ 2 callersFunctionlimitCheck
switch with precondition.
Basics/switch.go:43
↓ 2 callersFunctionlinearSearchSorted
(data []int, value int)
Searching/Searching.go:18
↓ 2 callersFunctionlinearSearchUnsorted
(data []int, value int)
Searching/Searching.go:9
↓ 2 callersFunctionmax
(a, b int)
AlgorithmsChapters/DP/Vacation.go:12
↓ 2 callersFunctionmin
(a, b int)
AlgorithmsChapters/DP/MinCostBinaryTree.go:8
← previousnext →201–300 of 1,518, ranked by callers