Functions — github.com/careermonk/data-structures-and-algorithms-made-easy-in-java

hub / github.com/careermonk/data-structures-and-algorithms-made-easy-in-java / functions

Functions490 in github.com/careermonk/data-structures-and-algorithms-made-easy-in-java

⨍ Functions 490◇ Types & classes 176

↓ 1 callersMethodconstruct

(ListNode head, int start, int end)

src/chapter06trees/SortedArrayToBST.java:27

↓ 1 callersMethodconvertArraytoSawToothWaveLinearTime

(int A[])

src/chapter10sorting/ConvertArraytoSawToothWaveLinearTime.java:18

↓ 1 callersMethodconvertStringToBoolArray

(String s)

src/chapter17greedyalgorithms/Huffman.java:172

↓ 1 callersMethodconverttoSawToothWave

Sort the array first. Then swap every adjacent element to get final result @param A

src/chapter10sorting/ConvertArraytoSawToothWave.java:26

↓ 1 callersMethoddutchNationalFlag

(int[] A)

src/chapter11searching/DutchNationalFlag.java:16

↓ 1 callersMethodenlargeArray

( int newSize )

src/chapter07priorityqueues/BinaryHeap.java:55

↓ 1 callersMethodequilibrium

(int[] A)

src/chapter21miscconcepts/Equilibrium.java:16

↓ 1 callersMethodexpand

()

src/chapter04stacks/DynamicArrayStack.java:62

↓ 1 callersMethodexpand

()

src/chapter05queues/DynamicArrayQueue.java:79

↓ 1 callersMethodexponenial

(double x, int n)

src/chapter18divideandconquer/ExponentialDivideAndConquer.java:29

↓ 1 callersMethodfactorial

(int n)

src/chapter02recursionandbacktracking/Factorial.java:16

↓ 1 callersMethodfibonacciWithDP2

(int n)

src/chapter19dynamicprogramming/FibonacciWithDP.java:33

↓ 1 callersMethodfindMaximumSubMatrix

(int[][] A)

src/chapter19dynamicprogramming/MaximumSumSubMatrix.java:16

↓ 1 callersMethodfindMedianSortedArrays

(int A[], int B[])

src/chapter12selectionalgorithms/MedianInTwoSortedArrays.java:16

↓ 1 callersMethodfindMin

( )

src/chapter07priorityqueues/BinaryHeap.java:64

↓ 1 callersMethodfindPeak

(int[] A)

src/chapter18divideandconquer/PeakFinder_1D_Binary_Search.java:4

↓ 1 callersMethodfindPeak

(int[] A)

src/chapter18divideandconquer/All_PeakFinder_1D_Linear_Search.java:5

↓ 1 callersMethodfindPeak

(int[] A)

src/chapter18divideandconquer/PeakFinder_1D_Linear_Search.java:5

↓ 1 callersMethodfindPeak

(int[] A)

src/chapter18divideandconquer/Highest_PeakFinder_1D_Linear_Search.java:5

↓ 1 callersMethodgetHuffmanBoolCodes

()

src/chapter17greedyalgorithms/Huffman.java:66

↓ 1 callersMethodgetNthStack

(int n)

src/chapter04stacks/StackSets.java:36

↓ 1 callersMethodhasNext

()

src/chapter09graphs/GraphAdjacencyMatrix.java:83

↓ 1 callersMethodhasNext

()

src/chapter09graphs/GraphAdjacencyList.java:60

↓ 1 callersMethodhasNext

()

src/chapter09graphs/DFS.java:81

↓ 1 callersMethodinsert

( AnyType x )

src/chapter07priorityqueues/BinaryHeap.java:43

↓ 1 callersMethodinsertHelper

(BinaryTreeNode root, int data)

src/chapter06trees/InsertInBinaryTreeRecursive.java:27

↓ 1 callersMethodinsertionSortList

(ListNode head)

src/chapter03linkedlists/InsertionSortLinkedList.java:15

↓ 1 callersMethodinterpolationSearch

(int[] A, int data)

src/chapter11searching/InterpolationSearch.java:18

↓ 1 callersMethodisAtCapacity

()

src/chapter04stacks/StackForStackSets.java:39

↓ 1 callersMethodisBST

(BinarySearchTreeNode root)

src/chapter06trees/CheckValidBSTRecursiveSingleVariable.java:21

↓ 1 callersMethodisBST

(BinarySearchTreeNode root, int min, int max)

src/chapter06trees/CheckValidBSTRecursive.java:20

↓ 1 callersMethodisEmpty

()

src/chapter03linkedlists/CircularLinkedList.java:145

↓ 1 callersMethodisLeaf

()

src/chapter06trees/BinaryTreeNode.java:58

↓ 1 callersMethodlevel

()

src/chapter03linkedlists/SkipList.java:37

↓ 1 callersMethodlogNUp

(int n)

src/chapter01introduction/LogNComplexityDown.java:24

↓ 1 callersMethodlogNUp

(int n)

src/chapter01introduction/LogNComplexityUp.java:25

↓ 1 callersMethodmax3

(int a, int b, int c)

src/chapter18divideandconquer/MaxSumSubArrayDividAndConquer.java:43

↓ 1 callersMethodmaxDepthRecursive

(BinaryTreeNode root)

src/chapter06trees/WidthOfTree.java:40

↓ 1 callersMethodmaxSubSquareMatrixWith1s

(int[][] A)

src/chapter19dynamicprogramming/MaxSubSquareMatrixWith1s.java:16

↓ 1 callersMethodnLogN

(int n)

src/chapter01introduction/NlogNComplexity.java:24

↓ 1 callersMethodnPower3By2

(int n)

src/chapter01introduction/NPower3By2Complexity.java:23

↓ 1 callersMethodnSquareLogN

(int n)

src/chapter01introduction/NSquareLogNComplexity.java:26

↓ 1 callersMethodnSquareLogN2

(int n)

src/chapter01introduction/NSquareLogNComplexity.java:37

↓ 1 callersMethodnSquareLogN3

(int n)

src/chapter01introduction/NSquareLogNComplexity.java:48

↓ 1 callersMethodorderN

(int n)

src/chapter01introduction/NComplexity.java:24

↓ 1 callersMethodorderStatistic

(int[] A, int k, int start, int end)

src/chapter12selectionalgorithms/KthSmallest.java:60

↓ 1 callersMethodorderStatistic

(int[] A, int k, int start, int end)

src/chapter12selectionalgorithms/KthLargest.java:60

↓ 1 callersMethodprintArray

(int[] ints, int len)

src/chapter06trees/PrintPaths.java:36

↓ 1 callersMethodprintList

(ListNode x)

src/chapter03linkedlists/InsertionSortLinkedList.java:78

↓ 1 callersMethodprintListFromEnd

(ListNode head)

src/chapter03linkedlists/PrintListInReverse.java:17

↓ 1 callersMethodquickSort

(int A[], int low, int high)

src/chapter10sorting/QuickSort.java:18

↓ 1 callersMethodrecursiveFibonacci

(int n)

src/chapter19dynamicprogramming/RecursiveFibonacci.java:23

↓ 1 callersMethodremove

(int position)

src/chapter03linkedlists/LinkedList.java:158

↓ 1 callersMethodromanToDecimal

(java.lang.String romanNumber)

src/chapter21miscconcepts/RomanToDecimal.java:21

↓ 1 callersMethodsetCode

(String code)

src/chapter17greedyalgorithms/HuffmanTreeNode.java:55

↓ 1 callersMethodsetHuffmanCodes

( )

src/chapter17greedyalgorithms/Huffman.java:142

↓ 1 callersMethodsetRight

(BinaryTreeNode right)

src/chapter06trees/BinaryTreeNode.java:45

↓ 1 callersMethodshrink

()

src/chapter04stacks/DynamicArrayStack.java:71

↓ 1 callersMethodsize

()

src/chapter09graphs/GraphAdjacencyList.java:36

↓ 1 callersMethodsize

()

src/chapter05queues/DynamicArrayQueue.java:74

↓ 1 callersMethodsquareRootN

(int n)

src/chapter01introduction/SquareRootNComplexity.java:23

↓ 1 callersMethodswap

(int num)

src/chapter21miscconcepts/SwapOddEvenBits.java:19

↓ 1 callersMethodswap

(int[] A, int left, int right)

src/chapter10sorting/QuickSort.java:48

↓ 1 callersMethodswap

(int A[],int low,int high)

src/chapter10sorting/ConvertArraytoSawToothWave.java:33

↓ 1 callersMethodtoString

()

src/chapter04stacks/StackForStackSets.java:48

↓ 1 callersMethodtoString

()

src/chapter09graphs/GraphAdjacencyMatrix.java:104

↓ 1 callersMethodtoString

()

src/chapter09graphs/GraphAdjacencyList.java:157

↓ 1 callersMethodtoString

()

src/chapter09graphs/DFS.java:102

↓ 1 callersMethodtoString

()

src/chapter06trees/BinaryTreeNode.java:72

↓ 1 callersMethodunion

(int root1, int root2)

src/chapter08disjointsets/DisjointSets.java:26

↓ 1 callersMethodvSum

(HashMap <Integer, Integer> hash,BinaryTreeNode root, int c)

src/chapter06trees/VerticalSum.java:20

MethodAdjIterator

(int u)

src/chapter09graphs/BFS.java:73

MethodAdjIterator

(int u)

src/chapter09graphs/GraphAdjacencyMatrix.java:75

MethodAdjIterator

(int u)

src/chapter09graphs/DFS.java:73

MethodBinaryHeap

( )

src/chapter07priorityqueues/BinaryHeap.java:19

MethodBinarySearchTreeNode

(int x)

src/chapter06trees/BinarySearchTreeNode.java:19

MethodBinaryTreeNode

(int data)

src/chapter06trees/BinaryTreeNode.java:20

MethodBuilding

(int x1, int h1, int x2)

src/chapter18divideandconquer/SkylinesDivideandConquer.java:18

MethodCLLNode

()

src/chapter03linkedlists/CLLNode.java:22

MethodCircularLinkedList

()

src/chapter03linkedlists/CircularLinkedList.java:22

MethodDLLNode

(int data)

src/chapter03linkedlists/DLLNode.java:22

MethodDisjointSets

(int numElements)

src/chapter08disjointsets/DisjointSets.java:19

MethodDoublyLinkedList

()

src/chapter03linkedlists/DoublyLinkedList.java:23

MethodDynamicArrayQueue

()

src/chapter05queues/DynamicArrayQueue.java:28

MethodDynamicArrayStack

()

src/chapter04stacks/DynamicArrayStack.java:33

MethodE

()

src/chapter09graphs/BFS.java:49

MethodE

()

src/chapter09graphs/GraphAdjacencyMatrix.java:51

MethodE

()

src/chapter09graphs/DFS.java:49

MethodFixedSizeArrayQueue

()

src/chapter05queues/FixedSizeArrayQueue.java:26

MethodFixedSizeArrayStack

()

src/chapter04stacks/FixedSizeArrayStack.java:30

MethodGetSkyline

(Building[] buildings, int start, int end)

src/chapter18divideandconquer/SkylinesDivideandConquer.java:53

MethodGraph

(int V)

src/chapter09graphs/BFS.java:23

MethodGraph

(int V)

src/chapter09graphs/GraphAdjacencyMatrix.java:27

MethodGraph

(int V)

src/chapter09graphs/GraphAdjacencyList.java:79

MethodGraph

(int V)

src/chapter09graphs/DFS.java:23

MethodHuffman

(int[] freq)

src/chapter17greedyalgorithms/Huffman.java:34

MethodHuffmanTreeNode

(int w,int ch)

src/chapter17greedyalgorithms/HuffmanTreeNode.java:27

MethodInOrder

(BinaryTreeNode root)

src/chapter06trees/InOrderRecursive.java:16

MethodLCA

(BinaryTreeNode root, BinaryTreeNode a, BinaryTreeNode b)

src/chapter06trees/LCABinaryTree.java:16

MethodLCA

(BinarySearchTreeNode root, BinarySearchTreeNode a, BinarySearchTreeNode b)

src/chapter06trees/LCABST.java:16

← previous next →101–200 of 490, ranked by callers