MCPcopy Create free account

hub / github.com/arnauddri/algorithms / functions

Functions292 in github.com/arnauddri/algorithms

⨍ Functions 292◇ Types & classes 27
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/quick-sort/quick.go:3
↓ 2 callersFunctionsort
(arr []int)
algorithms/sorting/shell-sort/shell.go:3
↓ 2 callersFunctionsub
(a, b *big.Int)
algorithms/maths/karatsuba/karatsuba.go:59
↓ 2 callersMethodtoString
()
algorithms/maths/closest-pair/closest_pair.go:37
↓ 1 callersFunctionBfs
(g *graph.DirGraph, start graph.VertexId, fn func(graph.VertexId))
algorithms/graphs/bfs/bfs.go:7
↓ 1 callersMethodClear
()
data-structures/linked-list/linked_list.go:163
↓ 1 callersMethodConcat
(k *List)
data-structures/linked-list/linked_list.go:169
↓ 1 callersMethodCountCols
()
data-structures/matrix/matrix.go:47
↓ 1 callersMethodDel
(key string)
data-structures/hash-tables/ht.go:59
↓ 1 callersMethodDelete
returns true if a node with value i was found and deleted and returns false otherwise
data-structures/binary-tree/bst.go:91
↓ 1 callersFunctionDirectedDfs
(g *graph.DirGraph, v graph.VertexId, fn func(graph.VertexId))
algorithms/graphs/dfs/dfs.go:27
↓ 1 callersMethodEdgesCount
()
data-structures/graph/graph.go:171
↓ 1 callersMethodFind
(node *Node)
data-structures/linked-list/linked_list.go:142
↓ 1 callersMethodForEach
(f func(*item))
data-structures/hash-tables/ht.go:78
↓ 1 callersFunctionGetArrayOfSize
(n int)
algorithms/sorting/utils/utils.go:11
↓ 1 callersFunctionGetDist
(g *graph.DirGraph, from graph.VertexId, to graph.VertexId)
algorithms/graphs/bfs-shortest-path/bfs_shortest_path.go:30
↓ 1 callersMethodGetEdge
(from, to VertexId)
data-structures/graph/graph.go:175
↓ 1 callersMethodGetPredecessors
(vertex VertexId)
data-structures/graph/directed_graph.go:17
↓ 1 callersFunctionIterOnTree
(n *Node, f func(*Node))
data-structures/binary-tree/bst.go:148
↓ 1 callersFunctionNew
(cap int)
data-structures/hash-tables/ht.go:23
↓ 1 callersFunctionNew
()
data-structures/stack/stack.go:11
↓ 1 callersFunctionNew
()
data-structures/queue/queue.go:11
↓ 1 callersFunctionNewMax
()
data-structures/heap/heap.go:30
↓ 1 callersFunctionNewMin
()
data-structures/heap/heap.go:23
↓ 1 callersFunctionNewMin
()
data-structures/priority-queue/priority_queue.go:34
↓ 1 callersFunctionNewTree
(n *Node)
data-structures/binary-tree/bst.go:31
↓ 1 callersFunctionNewUndirected
()
data-structures/graph/undirected_graph.go:7
↓ 1 callersMethodPeek
()
data-structures/stack/stack.go:52
↓ 1 callersMethodPeek
()
data-structures/queue/queue.go:53
↓ 1 callersFunctionScc
(g *graph.DirGraph)
algorithms/graphs/kosaraju/kosaraju.go:10
↓ 1 callersFunctionShortestPath
(g *graph.UnGraph, source graph.VertexId)
algorithms/graphs/dijkstra/dijkstra.go:10
↓ 1 callersFunctionSort
(g *graph.DirGraph)
algorithms/graphs/topological-sort/topological.go:8
↓ 1 callersFunctionUndirectedDfs
(g *graph.UnGraph, v graph.VertexId, fn func(graph.VertexId))
algorithms/graphs/dfs/dfs.go:8
↓ 1 callersMethodVerticesCount
()
data-structures/graph/graph.go:103
↓ 1 callersFunction_getMatrix
(n int, memo map[int][4]int)
algorithms/maths/fibonacci/fibonacci.go:37
↓ 1 callersFunction_pivot
(a, b *big.Int)
algorithms/maths/karatsuba/karatsuba.go:40
↓ 1 callersFunction_raiseToPower
(A [4]int, p int, memo map[int][4]int)
algorithms/maths/fibonacci/fibonacci.go:83
↓ 1 callersMethodadd
(B *Matrix)
data-structures/matrix/matrix.go:91
↓ 1 callersFunctionbenchmarkDivideAndConquer
(n int, b *testing.B)
algorithms/maths/closest-pair/closest_pair_test.go:55
↓ 1 callersFunctioncalcDistance
(A point, B point)
algorithms/maths/closest-pair/closest_pair.go:49
↓ 1 callersFunctiondivideAndConquer
(xP, yP []point)
algorithms/maths/closest-pair/closest_pair.go:80
↓ 1 callersMethodisEmpty
()
data-structures/stack/stack.go:26
↓ 1 callersMethodisEmpty
()
data-structures/queue/queue.go:27
↓ 1 callersFunctionrecurse
(A *matrix.Matrix, B *matrix.Matrix)
algorithms/maths/strassen/strassen.go:34
↓ 1 callersMethodscale
(a float64)
data-structures/matrix/matrix.go:117
↓ 1 callersFunctionscaleSize
(n int)
algorithms/maths/strassen/strassen.go:127
↓ 1 callersFunctionshuffle
(a []int)
algorithms/maths/fisher-yates/fisherYates.go:15
↓ 1 callersMethodsiftDown
()
data-structures/heap/heap.go:90
↓ 1 callersMethodsiftUp
()
data-structures/heap/heap.go:79
↓ 1 callersMethodsubstract
(B *Matrix)
data-structures/matrix/matrix.go:104
↓ 1 callersMethodtrace
()
data-structures/matrix/matrix.go:83
FunctionAdd
(A *Matrix, B *Matrix)
data-structures/matrix/matrix.go:125
FunctionBenchmarkBruteForce
(b *testing.B)
algorithms/maths/closest-pair/closest_pair_test.go:42
FunctionBenchmarkBubbleSort100
(b *testing.B)
algorithms/sorting/bubble-sort/bubble_test.go:29
FunctionBenchmarkBubbleSort1000
(b *testing.B)
algorithms/sorting/bubble-sort/bubble_test.go:30
FunctionBenchmarkBubbleSort10000
(b *testing.B)
algorithms/sorting/bubble-sort/bubble_test.go:31
FunctionBenchmarkBubbleSort100000
(b *testing.B)
algorithms/sorting/bubble-sort/bubble_test.go:32
FunctionBenchmarkDivideAndConquer
func BenchmarkDivideAndConquer100(b *testing.B) { benchmarkDivideAndConquer(100, b) } func BenchmarkDivideAndConquer1000(b *testing.B) { benc
algorithms/maths/closest-pair/closest_pair_test.go:75
FunctionBenchmarkFastPower
(b *testing.B)
algorithms/maths/fast-power/fast_power_test.go:32
FunctionBenchmarkGetAllPrimesTo10
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:16
FunctionBenchmarkGetAllPrimesTo100
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:17
FunctionBenchmarkGetAllPrimesTo1000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:18
FunctionBenchmarkGetAllPrimesTo10000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:19
FunctionBenchmarkGetAllPrimesTo100000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:20
FunctionBenchmarkGetAllPrimesTo1000000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:21
FunctionBenchmarkGetAllPrimesTo10000000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:22
FunctionBenchmarkGetAllPrimesTo100000000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:23
FunctionBenchmarkGetAllPrimesTo1000000000
(b *testing.B)
algorithms/maths/eratosthenes-sieve/primes_benchmark.go:24
FunctionBenchmarkGetCoeff
(b *testing.B)
algorithms/maths/euclide/extended_gcd_test.go:32
FunctionBenchmarkHeapSort100
(b *testing.B)
algorithms/sorting/heap-sort/heap_test.go:29
FunctionBenchmarkHeapSort1000
(b *testing.B)
algorithms/sorting/heap-sort/heap_test.go:30
FunctionBenchmarkHeapSort10000
(b *testing.B)
algorithms/sorting/heap-sort/heap_test.go:31
FunctionBenchmarkHeapSort100000
(b *testing.B)
algorithms/sorting/heap-sort/heap_test.go:32
FunctionBenchmarkInsertionSort100
(b *testing.B)
algorithms/sorting/insertion-sort/insertion_test.go:29
FunctionBenchmarkInsertionSort1000
(b *testing.B)
algorithms/sorting/insertion-sort/insertion_test.go:30
FunctionBenchmarkInsertionSort10000
(b *testing.B)
algorithms/sorting/insertion-sort/insertion_test.go:31
FunctionBenchmarkInsertionSort100000
(b *testing.B)
algorithms/sorting/insertion-sort/insertion_test.go:32
FunctionBenchmarkIter
(b *testing.B)
algorithms/maths/stein/gcd_test.go:31
FunctionBenchmarkIter10
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:47
FunctionBenchmarkIter100
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:48
FunctionBenchmarkIter1000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:49
FunctionBenchmarkIter10000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:50
FunctionBenchmarkIter100000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:51
FunctionBenchmarkIter1000000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:52
FunctionBenchmarkIter10000000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:53
FunctionBenchmarkIterative
(b *testing.B)
algorithms/maths/permutations-count/permutations_test.go:34
FunctionBenchmarkKaratsubaMultiply
(b *testing.B)
algorithms/maths/karatsuba/karatsuba_test.go:35
FunctionBenchmarkMatrix10
func BenchmarkRecurse10(b *testing.B) { benchmarkRecurse(10, b) } func BenchmarkRecurse100(b *testing.B) { benchmarkRecurse(100, b) } func Benc
algorithms/maths/fibonacci/fibonacci_test.go:61
FunctionBenchmarkMatrix100
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:62
FunctionBenchmarkMatrix1000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:63
FunctionBenchmarkMatrix10000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:64
FunctionBenchmarkMatrix100000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:65
FunctionBenchmarkMatrix1000000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:66
FunctionBenchmarkMatrix10000000
(b *testing.B)
algorithms/maths/fibonacci/fibonacci_test.go:67
FunctionBenchmarkMergeSort100
(b *testing.B)
algorithms/sorting/merge-sort/merge_test.go:29
FunctionBenchmarkMergeSort1000
(b *testing.B)
algorithms/sorting/merge-sort/merge_test.go:30
FunctionBenchmarkMergeSort10000
(b *testing.B)
algorithms/sorting/merge-sort/merge_test.go:31
FunctionBenchmarkMergeSort100000
(b *testing.B)
algorithms/sorting/merge-sort/merge_test.go:32
FunctionBenchmarkMultiply
(b *testing.B)
algorithms/maths/karatsuba/karatsuba_test.go:28
FunctionBenchmarkMultiply
(b *testing.B)
algorithms/maths/strassen/strassen_test.go:64
← previousnext →101–200 of 292, ranked by callers