MCPcopy Create free account

hub / github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java / functions

Functions1,174 in github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java

⨍ Functions 1,174◇ Types & classes 150
↓ 2 callersMethodprintTree
()
CHAPTER 9 TREE/SPLAYTree.java:21
↓ 2 callersMethodquickSelectUtil
(int arr[], int lower, int upper, int k)
CHAPTER 5 SEARCHING/Searching.java:2328
↓ 2 callersMethodquickSelectUtil
(int[] arr, int lower, int upper, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:123
↓ 2 callersMethodremove
()
CHAPTER 8 QUEUE/QueueUsingStack.java:16
↓ 2 callersMethodremove
()
CHAPTER 8 QUEUE/QueueLL.java:49
↓ 2 callersMethodremoveHead
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:66
↓ 2 callersMethodremoveNode
(int key)
CHAPTER 6 LINKED LIST/CircularLinkedList.java:70
↓ 2 callersMethodremoveTail
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:86
↓ 2 callersMethodreverseString
(char[] expn)
CHAPTER 7 STACK/StackExercise.java:215
↓ 2 callersMethodrightLeftRotate
(Node x)
CHAPTER 9 TREE/AVLTree.java:132
↓ 2 callersMethodsearch
(int key)
CHAPTER 9 TREE/BTree.java:56
↓ 2 callersMethodsize
()
CHAPTER 6 LINKED LIST/LinkedList.java:18
↓ 2 callersMethodsmallerThenTripletCount
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:1147
↓ 2 callersMethodsortedInsert
(Stack<Integer> stk, int element)
CHAPTER 7 STACK/StackExercise.java:359
↓ 2 callersMethodsplit
(Node parent, Node child, int index)
CHAPTER 9 TREE/BTree.java:147
↓ 2 callersMethodswap
(char[] arr, int i, int j)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:330
↓ 2 callersMethodswap
(int arr[], int first, int second)
CHAPTER 4 SORTING/QuickSelect.java:31
↓ 2 callersMethodswap
(int arr[], int first, int second)
CHAPTER 4 SORTING/QuickSort.java:31
↓ 2 callersMethodswap
(int arr[], int i, int j)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:117
↓ 2 callersMethodupdate
(int index, int val)
CHAPTER 9 TREE/BinaryIndexTree.java:25
↓ 2 callersMethodupdate
(int ind, int val)
CHAPTER 9 TREE/rmqST.java:61
↓ 1 callersMethodCircularTour
(int[][] arr, int n)
CHAPTER 8 QUEUE/QueueEx.java:6
↓ 1 callersMethodCircularTour2
(int[][] arr, int n)
CHAPTER 8 QUEUE/QueueEx.java:23
↓ 1 callersMethodKMP
(String textIn, String patternIn)
CHAPTER 13 STRING ALGORITHMS/StringMatching.java:78
↓ 1 callersMethodKMPFindCount
(String textIn, String patternIn)
CHAPTER 13 STRING ALGORITHMS/StringMatching.java:98
↓ 1 callersMethodKS01UnboundBU
(int[] wt, int[] cost, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:82
↓ 1 callersMethodLCSubStr
(String st1, String st2)
CHAPTER 18 DYNAMIC PROGRAMMING/LongestCommonSubseq.java:2
↓ 1 callersMethodMatrixChainMulBU
(int[] p, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:57
↓ 1 callersMethodMatrixChainMulBU2
(int[] p, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:92
↓ 1 callersMethodMatrixChainMulBruteForce
(int[] p, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:5
↓ 1 callersMethodMatrixChainMulTD
(int[] p, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:32
↓ 1 callersMethodPrintLCS
(int[][] p, char[] X, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/LongestCommonSubseq.java:26
↓ 1 callersMethodPrintOptPar
(int n, int[][] pos, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:75
↓ 1 callersMethodPrintOptimalParenthesis
(int n, int[][] pos)
CHAPTER 18 DYNAMIC PROGRAMMING/MatrixCM.java:86
↓ 1 callersMethodabcTriplet
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1107
↓ 1 callersMethodabcTriplet2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1116
↓ 1 callersMethodabsBubbleSort
(int[] arr, int size, int ref)
CHAPTER 4 SORTING/SortingEx.java:208
↓ 1 callersMethodabsGreater
(int value1, int value2, int ref)
CHAPTER 4 SORTING/SortingEx.java:204
↓ 1 callersMethodadd
(int value)
CHAPTER 10 PRIORITY QUEUE & HEAPS/MedianHeap.java:14
↓ 1 callersMethodadd2
(int value)
CHAPTER 10 PRIORITY QUEUE & HEAPS/KthLargestStream.java:28
↓ 1 callersMethodaddBinary
(String st1, String st2)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:376
↓ 1 callersMethodaddTail
(int value)
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:54
↓ 1 callersMethodaddTail
(int value)
CHAPTER 6 LINKED LIST/LinkedList.java:39
↓ 1 callersMethodancestor
(int first, int second)
CHAPTER 9 TREE/Tree.java:407
↓ 1 callersMethodandEx
(int a, int b)
CHAPTER 5 SEARCHING/BitManipulation.java:2
↓ 1 callersMethodapTriplets
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1187
↓ 1 callersMethodarrayIndexMaxDiff
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2621
↓ 1 callersMethodarrayIndexMaxDiff2
(int arr[], int size)
CHAPTER 5 SEARCHING/Searching.java:2638
↓ 1 callersMethodarrayReduction
(int[] arr, int size)
CHAPTER 4 SORTING/SortingEx.java:235
↓ 1 callersMethodbellmanFordShortestPath
(int source)
CHAPTER 12 GRAPHS/Graph.java:1018
↓ 1 callersMethodbfs
(int source, int target)
CHAPTER 12 GRAPHS/Graph.java:107
↓ 1 callersMethodbfsDistance
(int source, int dest)
CHAPTER 12 GRAPHS/Graph.java:374
↓ 1 callersMethodbfsLevelNode
(int source)
CHAPTER 12 GRAPHS/Graph.java:350
↓ 1 callersMethodbinarySearch01
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1730
↓ 1 callersMethodbinarySearch01Util
(int[] arr, int start, int end)
CHAPTER 5 SEARCHING/Searching.java:1737
↓ 1 callersMethodbinarySearchRecUtil
(int[] arr, int low, int high, int value)
CHAPTER 5 SEARCHING/Searching.java:52
↓ 1 callersMethodbinarySearchRotateArray
(int[] arr, int size, int key)
CHAPTER 5 SEARCHING/Searching.java:1875
↓ 1 callersMethodbinarySearchRotateArrayUtil
(int[] arr, int start, int end, int key)
CHAPTER 5 SEARCHING/Searching.java:1852
↓ 1 callersMethodbitReversalEx
(int a)
CHAPTER 5 SEARCHING/BitManipulation.java:22
↓ 1 callersMethodborrowFromLeft
(Node node, int index)
CHAPTER 9 TREE/BTree.java:324
↓ 1 callersMethodborrowFromRight
(Node node, int index)
CHAPTER 9 TREE/BTree.java:354
↓ 1 callersMethodbruteForceSearch
(String textIn, String patternIn)
CHAPTER 13 STRING ALGORITHMS/StringMatching.java:2
↓ 1 callersMethodceilBST
(double val)
CHAPTER 9 TREE/Tree.java:919
↓ 1 callersMethodcheckPermutation
(char[] array1, int size1, char[] array2, int size2)
CHAPTER 5 SEARCHING/Searching.java:1938
↓ 1 callersMethodcheckPermutation2
(char[] arr1, int size1, char[] arr2, int size2)
CHAPTER 5 SEARCHING/Searching.java:1952
↓ 1 callersMethodcheckPermutation3
(char[] array1, int size1, char[] array2, int size2)
CHAPTER 5 SEARCHING/Searching.java:1972
↓ 1 callersMethodcheckReverse
(int[] arr, int size)
CHAPTER 4 SORTING/SortingEx.java:357
↓ 1 callersMethodchotaBhim
(int cups[])
CHAPTER 16 GREEDY ALGORITHM/ChotaBhim.java:15
↓ 1 callersMethodchotaBhim2
(int cups[])
CHAPTER 16 GREEDY ALGORITHM/ChotaBhim.java:38
↓ 1 callersMethodclosestNumber
(int arr[], int size, int num)
CHAPTER 5 SEARCHING/Searching.java:2183
↓ 1 callersMethodclosestPair
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:939
↓ 1 callersMethodclosestPair2
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:957
↓ 1 callersMethodclosestPairBF
(int[][] arr)
CHAPTER 15 BRUTE FORCE ALGORITHM/ClosestPair.java:6
↓ 1 callersMethodclosestPairUtil
(Point p[], int start, int stop, Point q[], int n)
CHAPTER 17 DIVIDE AND CONQUER/ClosestPair.java:61
↓ 1 callersMethodconstructST
(int input[], int start, int end, int index)
CHAPTER 9 TREE/SegmentTree.java:16
↓ 1 callersMethodconstructST
(int input[], int start, int end, int index)
CHAPTER 9 TREE/rangeMaxST.java:16
↓ 1 callersMethodconstructST
(int input[], int start, int end, int index)
CHAPTER 9 TREE/rmqST.java:16
↓ 1 callersMethodconvertXY
(int src, int dst)
CHAPTER 8 QUEUE/QueueEx.java:61
↓ 1 callersMethodcopyList
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:218
↓ 1 callersMethodcopyList
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:123
↓ 1 callersMethodcopyListReversed
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:207
↓ 1 callersMethodcopyListReversed
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:104
↓ 1 callersMethodcopyMirrorTree
()
CHAPTER 9 TREE/Tree.java:447
↓ 1 callersMethodcopyTree
()
CHAPTER 9 TREE/Tree.java:430
↓ 1 callersMethodcountAllPath
(int src, int dest)
CHAPTER 12 GRAPHS/Graph.java:217
↓ 1 callersMethodcountAllPathDFS
(boolean[] visited, int source, int dest)
CHAPTER 12 GRAPHS/Graph.java:201
↓ 1 callersMethodcountBits
(int a)
CHAPTER 5 SEARCHING/BitManipulation.java:61
↓ 1 callersMethodcountSort
(int arr[], int n, int dividend)
CHAPTER 4 SORTING/RadixSort.java:12
↓ 1 callersMethoddeleteList
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:120
↓ 1 callersMethoddeleteList
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:152
↓ 1 callersMethoddeleteNode
(int value)
CHAPTER 9 TREE/Tree.java:342
↓ 1 callersMethoddeleteNode
(int delValue)
CHAPTER 6 LINKED LIST/LinkedList.java:72
↓ 1 callersMethoddeleteNodes
(int delValue)
CHAPTER 6 LINKED LIST/LinkedList.java:95
↓ 1 callersMethoddfs
(int source, int target)
CHAPTER 12 GRAPHS/Graph.java:82
↓ 1 callersMethoddfsStack
(int source, int target)
CHAPTER 12 GRAPHS/Graph.java:63
↓ 1 callersMethoddijkstra
(int source)
CHAPTER 12 GRAPHS/Graph.java:980
↓ 1 callersMethoddijkstra
(int source)
CHAPTER 12 GRAPHS/GraphAM.java:73
↓ 1 callersMethoddistNearestFill
(int[][] arr, int maxCol, int maxRow)
CHAPTER 8 QUEUE/QueueEx.java:418
↓ 1 callersMethoddistNearestFill2
(int[][] arr, int maxCol, int maxRow)
CHAPTER 8 QUEUE/QueueEx.java:454
↓ 1 callersMethoddistNearestFillUtil
(int[][] arr, int maxCol, int maxRow, int currCol, int currRow, int[][] traversed, int dist)
CHAPTER 8 QUEUE/QueueEx.java:404
← previousnext →201–300 of 1,174, ranked by callers