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 callersFunctionmin
(a, b, c int)
AlgorithmsChapters/DP/GridMinCost.go:40
↓ 2 callersFunctionmin
(a, b int)
AlgorithmsChapters/DP/Vacation.go:5
↓ 2 callersFunctionmin
(a, b, c int)
AlgorithmsChapters/DP/EditDist.go:5
↓ 2 callersMethodparent
(node *Node)
Tree/SPLAYTree.go:107
↓ 2 callersFunctionpartition
(arr []int, low int, high int, pivot int)
AlgorithmsChapters/DAC/NutsAndBolts.go:25
↓ 2 callersMethodpercolateDown
(parent int)
Graph/GraphAM.go:427
↓ 2 callersMethodpercolateDown
(parent int)
Graph/hp.go:24
↓ 2 callersMethodpercolateDown
(parent int)
Graph/Graph.go:1573
↓ 2 callersMethodpercolateUp
percolateUp moves the element at the given index up the heap to its correct position
AlgorithmsChapters/Greedy/JoinRopes.go:134
↓ 2 callersMethodpercolateUp
(child int)
AlgorithmsChapters/Greedy/ChotaBhim.go:116
↓ 2 callersMethodpercolateUp
(child int)
AlgorithmsChapters/Greedy/OptimalMergePattern.go:79
↓ 2 callersMethodpercolateUp
(child int)
AlgorithmsChapters/Greedy/HuffmanTree.go:122
↓ 2 callersMethodpercolateUp
(child int)
Heap/heap2.go:51
↓ 2 callersMethodpercolateUp
(child int)
Heap/Heap.go:57
↓ 2 callersMethodpercolateUp
(child int)
Graph/GraphAM.go:443
↓ 2 callersMethodpercolateUp
(child int)
Graph/hp.go:40
↓ 2 callersMethodpercolateUp
(child int)
Graph/Graph.go:1589
↓ 2 callersFunctionprecedence
* Output: Parenthesis Count : 1234435521 */
Stack/StackExercise.go:520
↓ 2 callersFunctionreverseStack
* Output: [4 1 2 3] */
Stack/StackExercise.go:127
↓ 2 callersFunctionreverseString
(in string)
Stack/StackExercise.go:595
↓ 2 callersMethodrightLeftRotate
Function to right then left rotate subtree rooted with x
Tree/AVLTree.go:111
↓ 2 callersFunctionsortedInsert
* Output: main line 1 fun1 line 1 fun2 line 1 fun1 line 2 main line 2 */
Stack/StackExercise.go:35
↓ 2 callersMethodsplit
(parent *Node, child *Node, index int)
Tree/BTree.go:147
↓ 2 callersFunctionswap
(arr []int, i int, j int)
Heap/heap2.go:405
↓ 2 callersFunctionswap
(arr []int, i int, j int)
Heap/Heap.go:390
↓ 2 callersFunctionswap
(arr []int, first int, second int)
Sorting/QuickSelect.go:35
↓ 2 callersFunctionswap
(arr []int, first int, second int)
Sorting/QuickSort.go:34
↓ 2 callersMethodswap
swap swaps the elements at the given indices in the heap's array
AlgorithmsChapters/Greedy/JoinRopes.go:109
↓ 2 callersMethodswap
(i, j int)
AlgorithmsChapters/Greedy/ChotaBhim.go:96
↓ 2 callersMethodswap
(i, j int)
AlgorithmsChapters/Greedy/OptimalMergePattern.go:59
↓ 2 callersMethodswap
(i, j int)
AlgorithmsChapters/Greedy/HuffmanTree.go:102
↓ 2 callersMethodswap
(i, j int)
Heap/heap2.go:31
↓ 2 callersMethodswap
(i, j int)
Heap/Heap.go:37
↓ 2 callersMethodswap
(i, j int)
Graph/GraphAM.go:423
↓ 2 callersMethodswap
(i, j int)
Graph/hp.go:20
↓ 2 callersMethodswap
(i, j int)
Graph/Graph.go:1569
↓ 2 callersFunctionunion
consider x and y are roots of sets.
Graph/Graph.go:576
↓ 1 callersFunctionAPTriplets
* SmallerThenTripletCount: 13 SmallerThenTripletCount: 13 */
Searching/Searching.go:1269
↓ 1 callersFunctionAbcTriplet
* Triplet with sum 6 are : (1 2 3)(2 7 -3)(-4 3 7) Triplet with sum 6 are : (-4 3 7)(-3 2 7)(1 2 3) */
Searching/Searching.go:1177
↓ 1 callersFunctionAbcTriplet2
(arr []int)
Searching/Searching.go:1191
↓ 1 callersFunctionAdd
(n *TreeNode, value int)
Basics/Tree.go:20
↓ 1 callersMethodAdd
(value interface{})
Queue/QueueLinkedLIst.go:18
↓ 1 callersMethodAddTail
(value int)
LinkedLIst/DoublyLinkedList.go:46
↓ 1 callersFunctionAndEx
(a int, b int)
Searching/BitManipulation.go:5
↓ 1 callersMethodArea
()
Basics/Shape.go:9
↓ 1 callersFunctionArrayIndexMaxDiff
(arr []int, size int)
IntroductoryChapters/Intro.go:397
↓ 1 callersFunctionArrayIndexMaxDiff2
(arr []int, size int)
IntroductoryChapters/Intro.go:415
↓ 1 callersFunctionArrayReduction
(arr []int, size int)
Sorting/SortingEx.go:265
↓ 1 callersMethodBFS
(source int, target int)
Graph/Graph.go:135
↓ 1 callersMethodBellmanFordShortestPath
* Shortest Paths: (0->1 @ 4) (0->1->2 @ 12) (0->1->2->3 @ 19) (0->7->6->5->4 @ 21) (0->7->6->5 @ 11) (0->7->6 @ 9) (0->7 @ 8) (0->1->2->8 @ 14) */
Graph/Graph.go:1272
↓ 1 callersMethodBfsDistance
(source int, dest int)
Graph/Graph.go:421
↓ 1 callersMethodBfsLevelNode
* 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 */
Graph/Graph.go:396
↓ 1 callersFunctionBinarySearch01
(data []int)
Searching/Searching.go:1839
↓ 1 callersFunctionBinarySearch01Util
(data []int, start int, end int)
Searching/Searching.go:1847
↓ 1 callersFunctionBinarySearchRecursiveUtil
(data []int, low int, high int, value int)
IntroductoryChapters/Intro.go:605
↓ 1 callersFunctionBinarySearchRotateArrayUtil
(data []int, start int, end int, key int)
Searching/Searching.go:1925
↓ 1 callersFunctionBitReversalEx
(a int)
Searching/BitManipulation.go:9
↓ 1 callersFunctionBruteForceSearch
(text string, pattern string)
String/StringMatching.go:11
↓ 1 callersFunctionBubbleSort2
BubbleSort2 sorts the array using the specified comparison function. It includes an optimization to stop early if no swaps are made in a pass.
Sorting/BubbleSort.go:30
↓ 1 callersFunctionBucketSort
(arr []int, maxValue, numBucket int)
Sorting/BucketSort.go:9
↓ 1 callersMethodCeilBST
(val int)
Tree/Tree.go:910
↓ 1 callersFunctionCheckPermutation
* abababab */
Searching/Searching.go:2064
↓ 1 callersFunctionCheckPermutation2
(data1 string, data2 string)
Searching/Searching.go:2099
↓ 1 callersFunctionCheckPermutation3
(data1 string, data2 string)
Searching/Searching.go:2121
↓ 1 callersFunctionChotaBhim
(cups []int)
AlgorithmsChapters/Greedy/ChotaBhim.go:9
↓ 1 callersFunctionChotaBhim2
(cups []int)
AlgorithmsChapters/Greedy/ChotaBhim.go:36
↓ 1 callersFunctionCircularTour
Position : 8
Queue/QueueEX.go:41
↓ 1 callersFunctionCircularTour2
(arr [][2]int, n int)
Queue/QueueEX.go:59
↓ 1 callersFunctionClosestNumber
(arr []int, size int, num int)
Searching/Searching.go:2339
↓ 1 callersFunctionClosestPair
* MinDiff 1 MinDiff 1 The pair is: 9 & 10 Minimum difference is : 1 The pair is : 9 & 10 Minimum difference is : 1 */
Searching/Searching.go:983
↓ 1 callersFunctionClosestPair2
(arr []int, value int)
Searching/Searching.go:1002
↓ 1 callersFunctionClosestPairBF
(arr [][]int)
AlgorithmsChapters/DAC/ClosestPair.go:22
↓ 1 callersFunctionClosestPairDC
(arr [][]int)
AlgorithmsChapters/DAC/ClosestPair.go:38
↓ 1 callersMethodCompareList
(ll *List)
LinkedLIst/LinkedLIst.go:246
↓ 1 callersFunctionConvertXY
* Starting Point : 1 Starting Point 2 : 1 */
Queue/QueueEX.go:102
↓ 1 callersMethodCopyList
()
LinkedLIst/LinkedLIst.go:220
↓ 1 callersMethodCopyList
()
LinkedLIst/CircularLinkedList.go:154
↓ 1 callersMethodCopyListReversed
()
LinkedLIst/LinkedLIst.go:206
↓ 1 callersMethodCopyListReversed
()
LinkedLIst/CircularLinkedList.go:137
↓ 1 callersMethodCopyMirrorTree
()
Tree/Tree.go:487
↓ 1 callersMethodCopyTree
()
Tree/Tree.go:470
↓ 1 callersFunctionCountBits
(a int)
Searching/BitManipulation.go:13
↓ 1 callersFunctionCountRotation
(arr []int)
Searching/Searching.go:1909
↓ 1 callersFunctionCountSort
CountSort performs counting sort on the given array within the specified range.
Sorting/CountSort.go:6
↓ 1 callersFunctionCreateHeap
CreateHeap creates a new heap with the given comparison function
AlgorithmsChapters/Greedy/JoinRopes.go:89
↓ 1 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool, args ...[]interface{})
AlgorithmsChapters/Greedy/ChotaBhim.go:79
↓ 1 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool, args ...[]interface{})
AlgorithmsChapters/Greedy/OptimalMergePattern.go:42
↓ 1 callersFunctionCreateHeap
(comp func(x interface{}, y interface{}) bool, args ...[]interface{})
AlgorithmsChapters/Greedy/HuffmanTree.go:85
↓ 1 callersMethodDFS
(source, target int)
Graph/Graph.go:101
↓ 1 callersMethodDFSStack
* Vertex 0 is connected to : 2(cost:1) 1(cost:1) Vertex 1 is connected to : 2(cost:1) 0(cost:1) Vertex 2 is connected to : 3(cost:1) 1(cost:1) 0(cost:
Graph/Graph.go:76
↓ 1 callersMethodDeleteNode
(delValue int)
LinkedLIst/LinkedLIst.go:113
↓ 1 callersMethodDeleteNode
(value int)
Tree/Tree.go:382
↓ 1 callersMethodDijkstra
* Node index 0 is connected to : 1(cost:1) 2(cost:1) Node index 1 is connected to : 0(cost:1) 2(cost:1) Node index 2 is connected to : 0(cost:1) 1(cos
Graph/GraphAM.go:63
↓ 1 callersMethodDijkstra
* Shortest Paths: (0->1 @ 1) (0->1->2 @ 2) (0->1->2->3 @ 3) (0->7->6->5->4 @ 4) (0->7->6->5 @ 3) (0->7->6 @ 2) (0->7 @ 1) (0->7->8 @ 2) */
Graph/Graph.go:1201
↓ 1 callersFunctionDistNearestFill
(arr [][]int, maxCol int, maxRow int)
Queue/QueueEX.go:511
↓ 1 callersFunctionDistNearestFill2
(arr [][]int, maxCol int, maxRow int)
Queue/QueueEX.go:546
↓ 1 callersFunctionDistNearestFillUtil
* StepsOfKnight : 8 StepsOfKnight2 : 8 */
Queue/QueueEX.go:487
↓ 1 callersFunctionDuplicateKDistance
* 3 true 6 true 3 */
Searching/Searching.go:2376
↓ 1 callersFunctionEditDist
(str1, str2 string)
AlgorithmsChapters/DP/EditDist.go:17
↓ 1 callersFunctionEditDistDP
(str1, str2 string)
AlgorithmsChapters/DP/EditDist.go:45
← previousnext →301–400 of 1,518, ranked by callers