Functions — github.com/derekargueta/Interview-Prep

CodeHub MCPcopy Create free account

hub / github.com/derekargueta/Interview-Prep / functions

Functions65 in github.com/derekargueta/Interview-Prep

⨍ Functions 65 ◇ Types & classes 24

↓ 30 callersMethodgetAt

The strategy for a "get" in an unrolled linked list, is to reduce the index input by the length of the array on each node until the index is within th

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:87

↓ 13 callersMethodgetNext

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:194

↓ 12 callersMethodgetNext

src/com/dargueta/data_structures/lists/LinkedList.java:132

↓ 12 callersMethodinsert

src/com/dargueta/data_structures/lists/LinkedList.java:39

↓ 10 callersMethodgetArr

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:202

↓ 9 callersMethodgetSize

By keeping `size` a constant value we increment and decrement, getting the size of the list is very simply and cheap (O(1)) @return

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:164

↓ 7 callersMethodget

src/com/dargueta/data_structures/lists/LinkedList.java:82

↓ 5 callersMethodbubbleSort

SPACE: O(1) TIME : O(n^2) worst-case

src/com/dargueta/algorithms/Sorts.java:15

↓ 5 callersMethodinsertionSort

SPACE: O(1) TIME : O(n^2) worst-case BEST SCENARIOS: nearly sorted (b/c O(n) time) or small problem set (b/c low memory overhead) What this looks lik

src/com/dargueta/algorithms/Sorts.java:49

↓ 5 callersMethodquickSort

SPACE: O(log(n))

src/com/dargueta/algorithms/Sorts.java:174

↓ 5 callersMethodselectionSort

SPACE: O(1) TIME : O(n^2) worst-case IMPORTANT: non-adaptive. best for when swaps are expensive and you need as few as possible

src/com/dargueta/algorithms/Sorts.java:80

↓ 4 callersMethodgenerateRandomList

src/test/java/SortTests.java:15

↓ 4 callersMethodgetNext

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:74

↓ 4 callersMethodinsert

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:18

↓ 4 callersMethodinsert

This function adds an entire new node. For this, we simply take the same approach as with a standard linked list. @param arr

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:44

↓ 4 callersMethodtoString

src/com/dargueta/data_structures/lists/LinkedList.java:140

↓ 3 callersMethoddeleteAt

The strategy for "delete" is similar to that of "get" with one small change - we want to stay one node behind the node that contains the actual value.

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:116

↓ 3 callersMethodgetCount

src/com/dargueta/data_structures/lists/LinkedList.java:97

↓ 3 callersMethodgetVal

src/com/dargueta/data_structures/lists/LinkedList.java:128

↓ 3 callersMethodtoString

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:82

↓ 3 callersMethodtoString

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:210

↓ 2 callersMethodsetArr

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:206

↓ 2 callersMethodsetNext

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:198

↓ 2 callersMethodsetNext

src/com/dargueta/data_structures/lists/LinkedList.java:136

↓ 1 callersMethoddelete

src/com/dargueta/data_structures/lists/LinkedList.java:56

↓ 1 callersMethodgetLeftLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:64

↓ 1 callersMethodgetRightLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:68

↓ 1 callersMethodgetSize

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:33

↓ 1 callersMethodgetValue

src/com/dargueta/data_structures/trees/BinaryTree.java:60

↓ 1 callersMethodhasLeftLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:80

↓ 1 callersMethodhasRightLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:84

↓ 1 callersMethodinnerInsert

(T t, BNode<T> node)

src/com/dargueta/data_structures/trees/BinaryTree.java:17

↓ 1 callersMethodquicksortHelper

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

src/com/dargueta/algorithms/Sorts.java:135

↓ 1 callersMethodsetLeftLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:72

↓ 1 callersMethodsetNext

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:78

↓ 1 callersMethodsetRightLeaf

src/com/dargueta/data_structures/trees/BinaryTree.java:76

src/com/dargueta/data_structures/trees/BinaryTree.java:54

MethodBinaryTree

src/com/dargueta/data_structures/trees/BinaryTree.java:9

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:58

MethodDoubleLinkedList

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:13

MethodFastFibonacci

@param stopIndex the ith index of the Fibonacci sequence at which the function will halt. @return the time it takes to complete the sequence

src/com/dargueta/memoization/Fibonacci.java:26

src/com/dargueta/data_structures/lists/LinkedList.java:123

MethodLinkedList

src/com/dargueta/data_structures/lists/LinkedList.java:29

MethodSlowFibonacci

@param stopIndex the ith index of the Fibonacci sequence at which the function will halt. @return the time it takes to complete the sequence

src/com/dargueta/memoization/Fibonacci.java:16

(ULLNode next, int[] arr)

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:189

MethodUnrolledLinkedList

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:28

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:70

SPACE: O(1) TIME : O(nlog(n))

src/com/dargueta/algorithms/Sorts.java:130

src/com/dargueta/data_structures/trees/BinaryTree.java:39

(String args[])

src/test/java/TestRunner.java:11

(String[] args)

src/com/dargueta/data_structures/trees/Runner.java:8

(String[] args)

src/com/dargueta/data_structures/lists/Runner.java:9

MethodmergeSort

src/com/dargueta/algorithms/Sorts.java:119

Methodquick3Sort

src/com/dargueta/algorithms/Sorts.java:178

MethodshellSort

src/com/dargueta/algorithms/Sorts.java:109

MethodtestAddingToLinkedList

src/test/java/ListTests.java:13

MethodtestBubbleSort

src/test/java/SortTests.java:23

MethodtestDeleteFromLinkedList

src/test/java/ListTests.java:39

MethodtestGetFromLinkedList

src/test/java/ListTests.java:25

MethodtestInsertionSort

src/test/java/SortTests.java:58

MethodtestQuickSort

src/test/java/SortTests.java:128

MethodtestSelectionSort

src/test/java/SortTests.java:93

src/com/dargueta/data_structures/lists/DoubleLinkedList.java:37

src/com/dargueta/data_structures/lists/UnrolledLinkedList.java:168

src/com/dargueta/data_structures/lists/LinkedList.java:101