Functions — github.com/akzare/Algorithms

CodeHub MCPcopy Create free account

hub / github.com/akzare/Algorithms / functions

Functions688 in github.com/akzare/Algorithms

⨍ Functions 688◇ Types & classes 127

Methodoperator!=

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:293

Methodoperator!=

src/main/cpp/algorithms/datastructures/stack/ListStack.h:84

Methodoperator!=

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:83

Methodoperator!=

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:119

Methodoperator()

overload function call

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.h:127

Methodoperator()

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.h:164

Methodoperator()

src/main/cpp/algorithms/graphtheory/Graph.h:106

Methodoperator*

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:461

Methodoperator*

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:213

Methodoperator*

src/main/cpp/algorithms/datastructures/stack/ListStack.h:89

Methodoperator*

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:88

Methodoperator*

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:124

Methodoperator++

Postfix ++ overload

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:451

Methodoperator++

Postfix ++ overload

src/main/cpp/algorithms/datastructures/stack/ListStack.h:77

Methodoperator++

Postfix ++ overload

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:76

Methodoperator++

Postfix ++ overload

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:112

Methodoperator<

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.h:132

Methodoperator=

ToDo: stck and queue must be copied!

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:237

Methodoperator==

src/main/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTree.h:247

Methodpartition3

partiton array in such a way that all the elements whose value is equal to pivot are grouped together

src/main/cpp/algorithms/sorting/QuickSort3.h:64

src/main/python/algorithms/datastructures/stack/ArrayStack.py:60

Peek the top of the stack without removing an element Throws an exception if the stack is empty

src/main/python/algorithms/datastructures/stack/ListStack.py:53

src/main/python/algorithms/datastructures/stack/IntStack.py:48

src/main/python/algorithms/datastructures/queue/Queue.py:25

Peek the element at the front of the queue The method throws an error is the queue is empty

src/main/python/algorithms/datastructures/queue/LinkedQueue.py:36

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:46

Peek the top of the stack without removing an element Throws an exception if the stack is empty

src/main/cpp/algorithms/datastructures/stack/ListStack.h:129

src/main/cpp/algorithms/datastructures/stack/ArrayStack.h:82

src/main/cpp/algorithms/datastructures/queue/ArrayQueue.h:80

Peek the element at the front of the queue The method throws an error is the queue is empty

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:113

MethodpeekMinValue

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:130

src/main/cpp/algorithms/datastructures/queue/ArrayQueue.h:70

Poll an element from the front of the queue The method throws an error if the queue is empty

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:120

MethodpollMinKeyIndex

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:124

MethodpollardRho

src/main/cpp/algorithms/math/PrimeFactorization.h:82

src/main/cpp/algorithms/datastructures/stack/ArrayStack.h:72

MethodprimeFactorization

src/main/cpp/algorithms/math/PrimeFactorization.h:41

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:177

MethodprintSCCList

src/main/cpp/algorithms/graphtheory/TarjanSccSolverAdjacencyList.h:185

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:104

src/main/cpp/algorithms/datastructures/stack/ArrayStack.h:67

FunctionrandomRemoveTests

src/test/cpp/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.cpp:460

MethodrandomRemoveTests

src/test/python/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.py:340

MethodrandomizedQuickSort

Sort interval [lo, hi] inplace recursively This chooses random pivot value thus improving time complexity

src/main/cpp/algorithms/sorting/QuickSort3.h:98

Remove a value from this binary tree if it exists, O(n)

src/main/python/algorithms/datastructures/binarysearchtree/BinarySearchTree.py:101

Remove a particular value in the linked list, O(n)

src/main/python/algorithms/datastructures/linkedlist/DoublyLinkedList.py:262

Removes a key from the map and returns the value. NOTE: returns null if the value is null AND also returns null if the key does not exists.

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:386

Remove a node at a particular index, O(n)

src/main/python/algorithms/datastructures/linkedlist/DoublyLinkedList.py:235

Remove an arbitrary node from the linked list, O(1)

src/main/cpp/algorithms/datastructures/linkedlist/DoublyLinkedList.h:325

MethodresizeTable

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:186

Returns a number with the first n bits set to 1

src/main/python/algorithms/other/BitManipulations.py:45

Returns a number with the first n bits set to 1

src/main/cpp/algorithms/other/BitManipulations.h:62

Sets the i'th bit to 1

src/main/python/algorithms/other/BitManipulations.py:17

src/test/python/algorithms/search/InterpolationSearchTest.py:17

src/test/python/algorithms/sorting/SortingTest.py:48

src/test/python/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.py:113

src/test/python/algorithms/datastructures/stack/StackTest.py:23

src/test/python/algorithms/datastructures/queue/QueueTest.py:21

src/test/python/algorithms/datastructures/queue/IntQueueTest.py:21

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:17

src/test/python/algorithms/other/BitManipulationsTest.py:17

src/test/python/algorithms/other/SlidingWindowMaximumTest.py:21

src/test/python/algorithms/other/LazyRangeAdderTest.py:20

set (mutator) functions

src/main/cpp/algorithms/dp/MinimumWeightPerfectMatching.h:50

src/main/cpp/algorithms/dp/MinimumWeightPerfectMatching.h:51

MethodsetupProbing

These three methods are used to dictate how the probing is to actually occur for whatever open addressing scheme you are implementing.

src/main/cpp/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.h:102

src/main/cpp/algorithms/sorting/Heapsort.h:59

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:197

return the number of elements in the stack

src/main/python/algorithms/datastructures/stack/Stack.py:16

src/main/python/algorithms/datastructures/stack/ArrayStack.py:27

Returns the number of elements insize the stack

src/main/python/algorithms/datastructures/stack/IntStack.py:34

src/main/python/algorithms/datastructures/queue/Queue.py:29

src/main/python/algorithms/datastructures/queue/ArrayQueue.py:24

Return the size of the queue

src/main/cpp/algorithms/datastructures/queue/LinkedQueue.h:102

src/main/cpp/algorithms/dp/MinimumWeightPerfectMatching.h:134

src/main/cpp/algorithms/graphtheory/TarjanSccSolverAdjacencyList.h:91

Executes the Floyd-Warshall algorithm.

src/main/cpp/algorithms/graphtheory/FloydWarshallSolver.h:160

src/main/cpp/algorithms/graphtheory/BellmanFordAdjacencyMatrix.h:85

Solves the traveling salesman problem and caches solution.

src/main/cpp/algorithms/graphtheory/TspDynamicProgrammingIterative.h:210

src/main/cpp/algorithms/sorting/BucketSort.h:35

src/main/cpp/algorithms/sorting/QuickSort3.h:40

src/main/cpp/algorithms/sorting/CountingSort.h:36

src/main/cpp/algorithms/sorting/BubbleSort.h:34

src/test/cpp/algorithms/dp/MinimumWeightPerfectMatchingTest.cpp:103

Swap two elements

src/main/cpp/algorithms/sorting/QuickSort3.h:114

src/main/cpp/algorithms/sorting/BubbleSort.h:62

src/main/cpp/algorithms/sorting/Heapsort.h:80

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:219

src/main/cpp/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.h:205

src/test/python/algorithms/datastructures/stack/StackTest.py:30

src/test/python/algorithms/datastructures/queue/QueueTest.py:28

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:26

MethodternarySearch

Perform a ternary search on the interval low to high. Remember that your function must be a continuous unimodal function, this means a function which

src/main/cpp/algorithms/search/TernarySearch.h:47

MethodtestCoverage3

src/test/python/algorithms/search/InterpolationSearchTest.py:33

MethodtestCoverage4

src/test/python/algorithms/search/InterpolationSearchTest.py:39

MethodtestToString

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:296

src/test/python/algorithms/datastructures/binarysearchtree/BinarySearchTreeTest.py:172

Methodtest_AddAt

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:69

Methodtest_AddFirst

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:55

Methodtest_AddLast

src/test/python/algorithms/datastructures/linkedlist/DoublyLinkedListTest.py:62

← previous next →501–600 of 688, ranked by callers