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

↓ 1 callersMethodpartition

Performs Hoare partition algorithm for quicksort This function takes last element as pivot, places the pivot element at its correct posit

src/main/python/algorithms/sorting/QuickSort.py:41

↓ 1 callersMethodpartition3

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

src/main/python/algorithms/sorting/QuickSort3.py:35

↓ 1 callersMethodpeekFirst

Check the value of the first node if it exists, O(1)

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

↓ 1 callersMethodpeekLast

Check the value of the last node if it exists, O(1)

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

↓ 1 callersMethodpeekMinKeyIndex

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

↓ 1 callersMethodpermutations

Recursive method to generate all the permutations of a sequence at -> Current element we're considering used -> The elements we

src/main/python/algorithms/other/Permutations.py:35

↓ 1 callersMethodpollMinValue

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

↓ 1 callersMethodpop

Pop an element off the stack Throws an error is the stack is empty

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

↓ 1 callersMethodpostOrder

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

↓ 1 callersFunctionpostOrderTestTreeNode

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

↓ 1 callersMethodpostOrderTraversal

Returns as iterator to traverse the tree in post order

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

↓ 1 callersMethodpowerSetRecursive

Recursively generate the powerset (set of all subsets) of an array by maintaining a boolean array used to indicate which element have been se

src/main/python/algorithms/other/PowerSet.py:43

↓ 1 callersMethodpowerSetUsingBinary

Use the fact that numbers represented in binary can be used to generate all the subsets of an array

src/main/python/algorithms/other/PowerSet.py:23

↓ 1 callersMethodpreOrder

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

↓ 1 callersFunctionpreOrderTestTreeNode

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

↓ 1 callersMethodpreOrderTraversal

Returns as iterator to traverse the tree in pre order

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

↓ 1 callersMethodprintCombinationsWithRepetition

Given a sequence this method prints all the combinations of size 'r' in a given sequence which has each element repeated at most 'k' times

src/main/python/algorithms/other/CombinationsWithRepetition.py:62

↓ 1 callersMethodpush

Push an element on the stack

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

↓ 1 callersMethodquickSort3

src/main/python/algorithms/sorting/QuickSort3.py:31

↓ 1 callersMethodquicksort

Sort interval [lo, hi] inplace recursively low --> Starting index, high --> Ending index https://www.geeksforgeeks.org/quick-sort/

src/main/python/algorithms/sorting/QuickSort.py:28

↓ 1 callersMethodradixSort

Requires all numbers to be greater than or equal to 1

src/main/python/algorithms/sorting/RadixSort.py:44

↓ 1 callersMethodrandomFill

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

↓ 1 callersMethodrandomizedQuickSort

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

src/main/python/algorithms/sorting/QuickSort3.py:70

↓ 1 callersMethodrandomizedTest

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

↓ 1 callersMethodreconstructPath

Reconstructs the path (of nodes) from 'start' to 'end' inclusive. If the edges are unweighted then this method returns the shortest path from 'start'

src/main/cpp/algorithms/graphtheory/BreadthFirstSearchAdjacencyListIterative.h:172

↓ 1 callersMethodreconstructPath

Reconstructs the shortest path (of nodes) from 'start' to 'end' inclusive. @return An array of node indexes of the shortest path from 'start' to 'end

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

↓ 1 callersMethodreconstructShortestPath

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

↓ 1 callersMethodreverse

Function to reverse the linked list

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

↓ 1 callersMethodselectionSort

src/main/python/algorithms/sorting/SelectionSort.py:24

↓ 1 callersMethodset

Sets [index, index] = val

src/main/python/algorithms/other/SquareRootDecomposition.py:39

↓ 1 callersMethodsize

Get the number of nodes in this binary tree

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

↓ 1 callersMethodsize

Return the number of elements in the stack

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

↓ 1 callersMethodsize

Return the size of the queue

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

↓ 1 callersMethodsize

Return the size of this linked list

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

↓ 1 callersMethodsize

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

↓ 1 callersMethodsize

Return the size of this linked list

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

↓ 1 callersMethodsize

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

↓ 1 callersMethodslowRangeAdd

Adds `x` to the range [l, r] in arr

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

↓ 1 callersMethodsolve

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

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/CountingSort.py:18

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/SelectionSort.py:18

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/QuickSort.py:22

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/QuickSort3.py:25

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/InsertionSort.py:18

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/RadixSort.py:25

↓ 1 callersMethodsort

Sort the array using bubble sort. The idea behind bubble sort is to look for adjacent indexes which are out of place and interchange thei

src/main/python/algorithms/sorting/BubbleSort.py:17

↓ 1 callersMethodsort

src/main/python/algorithms/sorting/MergeSort.py:22

↓ 1 callersMethodswap

(self, ar, i, j)

src/main/python/algorithms/sorting/SelectionSort.py:37

↓ 1 callersMethodswap

(self, ar, i, j)

src/main/python/algorithms/sorting/InsertionSort.py:39

↓ 1 callersMethodswap

(self, ar, i, j)

src/main/python/algorithms/sorting/BubbleSort.py:38

↓ 1 callersMethodternarySearch

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

src/main/python/algorithms/search/TernarySearch.py:23

↓ 1 callersMethodtoString

Return a String view of this hash-table.

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

↓ 1 callersMethodtoString

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

↓ 1 callersMethodtoString

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

↓ 1 callersMethodtraverse

This method returns an iterator for a given TreeTraversalOrder. The ways in which you can traverse the tree are in four different ways: p

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

MethodArrayQueue

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

MethodArrayStack

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

MethodBellmanFordAdjacencyMatrix

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

FunctionBellmanFordMatrix_test

Example usage of BellmanFord

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

MethodBinarySearchTree

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

MethodBinarySearchTreeIter

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

FunctionBinarySearch_test

Example usage of Binary search

src/main/cpp/algorithms/search/BinarySearch.h:135

MethodBitManipulations

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

MethodBreadthFirstSearchAdjacencyListIterative

src/main/cpp/algorithms/graphtheory/BreadthFirstSearchAdjacencyListIterative.h:95

FunctionBridge_test

Example usage of Bridge

src/main/cpp/algorithms/graphtheory/BridgesAdjacencyList.h:157

MethodBridgesAdjacencyList

src/main/cpp/algorithms/graphtheory/BridgesAdjacencyList.h:120

MethodBruteForceMwpm

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

FunctionBubbleSort_test

Example usage of Bubble Sort

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

FunctionBucketSort_test

Example usage of Bucket Sort

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

FunctionCoinChange_test

src/main/cpp/algorithms/dp/CoinChange.h:132

FunctionCountingSort_test

Example usage of Counting Sort

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

MethodDepthFirstSearchAdjacencyListIterative

src/main/cpp/algorithms/graphtheory/DepthFirstSearchAdjacencyListIterative.h:58

MethodDijkstrasShortestPathAdjacencyList

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

MethodDijkstrasShortestPathAdjacencyListWithDHeap

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

FunctionDijkstrasShortestPathDHeap_test

Example usage of DijkstrasShortestPathDHeap

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

FunctionDijkstrasShortestPath_test

Example usage of DijkstrasShortestPath

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

MethodDoublyLinkedList

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

MethodFloydWarshallSolver

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

MethodFloydWarshallSolverTest

src/test/cpp/algorithms/graphtheory/FloydWarshallSolverTest.cpp:83

FunctionFloydWarshall_test

Example usage of Floyd Warshall

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

FunctionGCD_test

src/main/cpp/algorithms/math/GCD.h:45

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

MethodHashTableLinearProbing

src/main/cpp/algorithms/datastructures/hashtable/HashTableLinearProbing.h:42

MethodHashTableOpenAddressingBase

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

FunctionHeapSort_test

Example usage of Heap Sort

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

FunctionInterpolationSearch_test

Example usage of Interpolation search

src/main/cpp/algorithms/search/InterpolationSearch.h:63

FunctionIsPrime_test

src/main/cpp/algorithms/math/IsPrime.h:53

Before the iteration begins record the number of modifications done to the hash-table. This value should not change as we iterate otherwise a concurre

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

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

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

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

FunctionJosephusproblem_test

src/main/cpp/algorithms/dp/JosephusProblem.h:49

FunctionKnapsack01_test

src/main/cpp/algorithms/dp/Knapsack_01.h:95

FunctionLCM_test

src/main/cpp/algorithms/math/LCM.h:51

MethodLinkListTest

src/test/cpp/algorithms/datastructures/linkedlist/LinkedListTest.cpp:60

MethodLinkedQueue

Create an empty stack

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

MethodListStack

Create an empty stack

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

FunctionLongestCommonSubstring_test

src/main/cpp/algorithms/dp/LongestCommonSubstring.h:94

FunctionLongestIncreasingSubsequence_test

src/main/cpp/algorithms/dp/LongestIncreasingSubsequence.h:67

FunctionLongestPalindromeSubsequence_test

src/main/cpp/algorithms/dp/LongestPalindromeSubsequence.h:65

← previous next →201–300 of 688, ranked by callers