MCPcopy Create free account

hub / github.com/arnauddri/algorithms / functions

Functions292 in github.com/arnauddri/algorithms

⨍ Functions 292◇ Types & classes 27
↓ 33 callersMethodGetElm
(i int, j int)
data-structures/matrix/matrix.go:51
↓ 32 callersMethodInsert
(el Item)
data-structures/priority-queue/priority_queue.go:44
↓ 30 callersFunctionNewItem
(value interface{}, priority int)
data-structures/priority-queue/priority_queue.go:13
↓ 25 callersMethodAddEdge
(from, to VertexId, weight int)
data-structures/graph/graph.go:107
↓ 22 callersMethodInsert
(n Item)
data-structures/heap/heap.go:49
↓ 22 callersFunctionNewNode
(value interface{})
data-structures/linked-list/linked_list.go:25
↓ 22 callersMethodSetElm
(i int, j int, v float64)
data-structures/matrix/matrix.go:55
↓ 18 callersMethodAddVertex
(vertex VertexId)
data-structures/graph/graph.go:72
↓ 17 callersMethodLen
()
data-structures/heap/heap.go:41
↓ 14 callersMethodAdd
(value interface{}, index int)
data-structures/linked-list/linked_list.go:70
↓ 14 callersFunctionMakeMatrix
(Elements []float64, rows, cols int)
data-structures/matrix/matrix.go:34
↓ 13 callersMethodVerticesIter
()
data-structures/graph/graph.go:27
↓ 11 callersMethodPush
(el interface{})
data-structures/stack/stack.go:42
↓ 10 callersMethodGet
(index int)
data-structures/linked-list/linked_list.go:129
↓ 10 callersMethodLen
()
data-structures/linked-list/linked_list.go:29
↓ 9 callersFunctionbenchmarkGetAllPrimesTo
(n int, b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:10
↓ 9 callersFunctionmul
(a, b *big.Int)
algorithms/maths/karatsuba/karatsuba.go:55
↓ 9 callersFunctionslice
(args ...interface{})
data-structures/linked-list/linked_list_test.go:114
↓ 8 callersMethodIsEdge
(from, to VertexId)
data-structures/graph/graph.go:156
↓ 8 callersFunctionmakePoint
(x float64, y float64)
algorithms/maths/closest-pair/closest_pair.go:17
↓ 8 callersFunctionrecurse
(a, b int)
algorithms/maths/stein/gcd.go:5
↓ 7 callersMethodCompare
(m *Node)
data-structures/binary-tree/bst.go:16
↓ 7 callersFunctionbenchmarkIter
(n int, b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:29
↓ 7 callersFunctionbenchmarkMatrix
(n int, b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:41
↓ 6 callersMethodGet
(n int)
data-structures/heap/heap.go:45
↓ 6 callersMethodInsert
(i int)
data-structures/binary-tree/bst.go:38
↓ 6 callersMethodPut
(key, value string)
data-structures/hash-tables/ht.go:39
↓ 6 callersFunctionRSelect
(arr []int, n, i int)
algorithms/maths/RSelect/RSelect.go:7
↓ 5 callersMethodAppend
(value interface{})
data-structures/linked-list/linked_list.go:53
↓ 5 callersMethodExtract
()
data-structures/priority-queue/priority_queue.go:48
↓ 5 callersMethodPop
()
data-structures/stack/stack.go:33
↓ 5 callersFunctionadd
(a, b *big.Int)
algorithms/maths/karatsuba/karatsuba.go:51
↓ 5 callersFunctioniter
(a, b int)
algorithms/maths/stein/gcd.go:32
↓ 5 callersFunctionk_multiply
(a, b *big.Int)
algorithms/maths/karatsuba/karatsuba.go:9
↓ 4 callersMethodExtract
()
data-structures/heap/heap.go:59
↓ 4 callersFunctionFloatArrayEquals
(a []float64, b []float64)
data-structures/matrix/matrix_test.go:95
↓ 4 callersMethodGetNeighbours
(vertex VertexId)
data-structures/graph/graph.go:179
↓ 4 callersMethodLen
()
data-structures/priority-queue/priority_queue.go:40
↓ 4 callersFunctionMultiply
(A *matrix.Matrix, B *matrix.Matrix)
algorithms/maths/strassen/strassen.go:8
↓ 4 callersMethodPrepend
(value interface{})
data-structures/linked-list/linked_list.go:37
↓ 4 callersMethodSearch
(i int)
data-structures/binary-tree/bst.go:70
↓ 4 callersFunctionbenchmarkBubbleSort
(n int, b *testing.B)
algorithms/sorting/bubble-sort/bubble_test.go:22
↓ 4 callersFunctionbenchmarkHeapSort
(n int, b *testing.B)
algorithms/sorting/heap-sort/heap_test.go:22
↓ 4 callersFunctionbenchmarkInsertionSort
(n int, b *testing.B)
algorithms/sorting/insertion-sort/insertion_test.go:22
↓ 4 callersFunctionbenchmarkMergeSort
(n int, b *testing.B)
algorithms/sorting/merge-sort/merge_test.go:22
↓ 4 callersFunctionbenchmarkQuickSort
(n int, b *testing.B)
algorithms/sorting/quick-sort/quick_test.go:22
↓ 4 callersFunctionbenchmarkSelectionSort
(n int, b *testing.B)
algorithms/sorting/selection-sort/selection_test.go:22
↓ 4 callersFunctionbenchmarkShellSort
(n int, b *testing.B)
algorithms/sorting/shell-sort/shell_test.go:22
↓ 4 callersFunctionmakePair
(A point, B point)
algorithms/maths/closest-pair/closest_pair.go:40
↓ 3 callersFunctionBruteForce
(P []point)
algorithms/maths/closest-pair/closest_pair.go:144
↓ 3 callersMethodCheckVertex
(vertex VertexId)
data-structures/graph/graph.go:60
↓ 3 callersMethodCountRows
()
data-structures/matrix/matrix.go:43
↓ 3 callersMethodEach
(f func(node Node))
data-structures/linked-list/linked_list.go:182
↓ 3 callersFunctionFloatArrayEquals
(a []float64, b []float64)
algorithms/maths/strassen/strassen_test.go:37
↓ 3 callersMethodGet
(key string)
data-structures/hash-tables/ht.go:28
↓ 3 callersMethodGetSuccessors
(vertex VertexId)
data-structures/graph/directed_graph.go:36
↓ 3 callersMethodLen
()
data-structures/stack/stack.go:19
↓ 3 callersMethodLen
()
data-structures/queue/queue.go:20
↓ 3 callersMethodLess
(a, b Item)
data-structures/heap/heap.go:106
↓ 3 callersMethodMap
(f func(node *Node))
data-structures/linked-list/linked_list.go:175
↓ 3 callersMethodPush
(el interface{})
data-structures/queue/queue.go:43
↓ 3 callersMethodTouchVertex
(vertex VertexId)
data-structures/graph/graph.go:66
↓ 3 callersFunctiondivide
(a, b int)
algorithms/maths/euclide/extended_gcd.go:5
↓ 3 callersFunctiongetCoeff
(a, b int)
algorithms/maths/euclide/extended_gcd.go:13
↓ 3 callersFunctiongetIter
(n int)
algorithms/maths/fibonacci/fibonacci.go:8
↓ 3 callersFunctiongetMatrix
(n int)
algorithms/maths/fibonacci/fibonacci.go:31
↓ 3 callersFunctiongetRecurse
(n int)
algorithms/maths/fibonacci/fibonacci.go:20
↓ 3 callersFunctionhashCode
Horner's Method to hash string of length L (O(L))
data-structures/hash-tables/ht.go:110
↓ 3 callersFunctionnewton_sqrt
(n float64, precision, maxIterations float64)
algorithms/maths/newton-sqrt/newton_sqrt.go:7
↓ 3 callersMethodposition
(s string)
data-structures/hash-tables/ht.go:88
↓ 2 callersMethodChangePriority
(val interface{}, priority int)
data-structures/priority-queue/priority_queue.go:52
↓ 2 callersFunctionDivideAndConquer
(P []point)
algorithms/maths/closest-pair/closest_pair.go:60
↓ 2 callersMethodEdgesIter
()
data-structures/graph/graph.go:23
↓ 2 callersMethodIsVertex
(vertex VertexId)
data-structures/graph/graph.go:97
↓ 2 callersMethodLess
(than Item)
data-structures/heap/heap.go:8
↓ 2 callersFunctionNewDirected
()
data-structures/graph/directed_graph.go:7
↓ 2 callersFunctionNewList
()
data-structures/linked-list/linked_list.go:13
↓ 2 callersFunctionNewMax
()
data-structures/priority-queue/priority_queue.go:28
↓ 2 callersFunctionNewNode
(i int)
data-structures/binary-tree/bst.go:12
↓ 2 callersMethodOrder
()
data-structures/graph/graph.go:167
↓ 2 callersMethodRemove
(value interface{})
data-structures/linked-list/linked_list.go:101
↓ 2 callersMethodRemoveEdge
(from, to VertexId)
data-structures/graph/graph.go:137
↓ 2 callersMethodRemoveVertex
(vertex VertexId)
data-structures/graph/graph.go:83
↓ 2 callersMethodReverse
()
data-structures/graph/directed_graph.go:55
↓ 2 callersMethodShift
()
data-structures/queue/queue.go:34
↓ 2 callersFunctionShortestPath
(g *graph.DirGraph, start graph.VertexId)
algorithms/graphs/bfs-shortest-path/bfs_shortest_path.go:8
↓ 2 callersFunction_multiplyMatrix
(A [4]int, B [4]int)
algorithms/maths/fibonacci/fibonacci.go:72
↓ 2 callersFunction_split
(a *big.Int, m uint)
algorithms/maths/karatsuba/karatsuba.go:31
↓ 2 callersFunctionfast_power
Recursive - O(log n)
algorithms/maths/fast-power/fast_power.go:9
↓ 2 callersMethodfind
(i int, key string)
data-structures/hash-tables/ht.go:92
↓ 2 callersFunctiongetAllPrimesTo
(n int)
algorithms/maths/eratosthenes-sieve/primes.go:7
↓ 2 callersFunctioniterativeCount
(array []int)
algorithms/maths/permutations-count/permutations.go:46
↓ 2 callersFunctionrecursiveCount
(a []int)
algorithms/maths/permutations-count/permutations.go:5
↓ 2 callersFunctionsearch
(sortedArray []int, el int)
algorithms/searching/binary-search/binary_search.go:5
↓ 2 callersFunctionslow_power
Iterative - O(n)
algorithms/maths/fast-power/fast_power.go:39
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/insertion-sort/insertion.go:5
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/merge-sort/merge.go:3
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/selection-sort/selection.go:3
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/heap-sort/heap.go:7
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/bubble-sort/bubble.go:8
next →1–100 of 292, ranked by callers