MCPcopy Create free account

hub / github.com/algorithm-archivists/algorithm-archive / functions

Functions774 in github.com/algorithm-archivists/algorithm-archive

⨍ Functions 774◇ Types & classes 154
↓ 1 callersFunctionchaos_game
This is a general function to simulate a chaos game - output_points: pointer to an initialized output array - num: the number of iterations - initial_
contents/barnsley/code/c/barnsley.c:58
↓ 1 callersFunctionchaos_game
(n, shape_points)
contents/IFS/code/python/IFS.py:5
↓ 1 callersFunctionchaos_game
(iters: usize, shapes: Vec<Point>)
contents/IFS/code/rust/IFS.rs:9
↓ 1 callersFunctionchaos_game
contents/IFS/code/c/IFS.c:18
↓ 1 callersFunctioncheck
(result, threshold, time_step)
contents/forward_euler_method/code/python/euler.py:12
↓ 1 callersFunctioncheck
(result []float64, threshold, timeStep float64)
contents/forward_euler_method/code/go/euler.go:17
↓ 1 callersFunctioncheckEuler
(arr, timeStep, threshold)
contents/forward_euler_method/code/javascript/euler.js:9
↓ 1 callersMethodcheckResult
(double[] eulerResult, double threshold, double timestep)
contents/forward_euler_method/code/java/ForwardEuler.java:13
↓ 1 callersFunctioncheck_result
contents/forward_euler_method/code/cpp/euler.cpp:27
↓ 1 callersFunctioncheck_result
contents/forward_euler_method/code/c/euler.c:13
↓ 1 callersFunctionchoose
Return a random point from the non-empty PointVector
contents/IFS/code/cpp/IFS.cpp:35
↓ 1 callersMethodchooseMatch
()
contents/stable_marriage_problem/code/php/stable_marriage.php:70
↓ 1 callersMethodchooseMate
()
contents/stable_marriage_problem/code/java/stable-marriage.java:119
↓ 1 callersFunctionchooseNextPointOnHull
(currentPoint)
contents/jarvis_march/code/javascript/jarvis-march.js:13
↓ 1 callersFunctioncodebookRecurse
(node *node, cb *codebook, code []rune)
contents/huffman_encoding/code/go/huffman.go:68
↓ 1 callersFunctioncodebook_free
contents/huffman_encoding/code/c/huffman.c:197
↓ 1 callersFunctioncodebook_recurse
contents/huffman_encoding/code/c/huffman.c:168
↓ 1 callersFunctioncolor
(f_val, threshold)
contents/domain_coloring/code/python/domain_coloring.py:22
↓ 1 callersFunctioncompute_sobel
(signal)
contents/convolutions/2d/code/python/2d_convolution.py:46
↓ 1 callersFunctionconcat
The two concat functions are horribly inefficient */
contents/huffman_encoding/code/c/huffman.c:41
↓ 1 callersFunctionconcat_char
contents/huffman_encoding/code/c/huffman.c:48
↓ 1 callersFunctionconvolve_cyclic
(signal, filter_array)
contents/convolutions/1d/code/python/1d_convolution.py:5
↓ 1 callersFunctionconvolve_fft
(signal1, signal2)
contents/convolutions/convolutional_theorem/code/python/convolutional_theorem.py:5
↓ 1 callersFunctioncooley_tukey
(X)
contents/cooley_tukey/code/python/fft.py:15
↓ 1 callersFunctioncooley_tukey
contents/cooley_tukey/code/cpp/fft.cpp:37
↓ 1 callersFunctioncooley_tukey
(x: &[Complex<f64>])
contents/cooley_tukey/code/rust/fft.rs:39
↓ 1 callersFunctioncooley_tukey
(x)
contents/cooley_tukey/code/javascript/fft.js:17
↓ 1 callersFunctioncooley_tukey
contents/cooley_tukey/code/c/fft.c:37
↓ 1 callersFunctioncounterClockWise
(p1, p2, p3 point)
contents/jarvis_march/code/go/jarvis.go:27
↓ 1 callersFunctioncounterClockwise
(p1, p2, p3 point)
contents/graham_scan/code/go/graham.go:13
↓ 1 callersFunctioncounter_clockwise
Is the turn counter-clockwise?
contents/graham_scan/code/python/graham_scan.py:4
↓ 1 callersFunctioncounter_clockwise
Determines whether the angle abc is clockwise, counter-clockwise or colinear result > 0 : counter-clockwise result = 0 : colinear result < 0 : clockwi
contents/graham_scan/code/rust/graham_scan.rs:33
↓ 1 callersMethodcreateAllChildren
(Node node, int rowCount, int childrenCount)
contents/tree_traversal/code/java/Tree.java:100
↓ 1 callersFunctioncreateCodebook
(tree)
contents/huffman_encoding/code/javascript/huffman.js:27
↓ 1 callersFunctioncreateTree
(str)
contents/huffman_encoding/code/javascript/huffman.js:10
↓ 1 callersMethodcreateTree
()
contents/huffman_encoding/code/java/huffman.java:40
↓ 1 callersFunctioncreate_sobel_operators
()
contents/convolutions/2d/code/python/2d_convolution.py:36
↓ 1 callersFunctiondecode
(bitstring, tree)
contents/huffman_encoding/code/javascript/huffman.js:47
↓ 1 callersFunctiondecode
(message string, root *node)
contents/huffman_encoding/code/go/huffman.go:94
↓ 1 callersFunctiondecode
contents/huffman_encoding/code/c/huffman.c:242
↓ 1 callersMethoddecode
contents/huffman_encoding/code/cpp/huffman.cpp:206
↓ 1 callersMethoddecode
(&self, input: &str)
contents/huffman_encoding/code/rust/huffman.rs:87
↓ 1 callersMethoddecode
(String encoded)
contents/huffman_encoding/code/java/huffman.java:101
↓ 1 callersMethoddecode_dfs
(&self, input: &str, result: &mut String)
contents/huffman_encoding/code/rust/huffman.rs:96
↓ 1 callersFunctiondecode_recurse
contents/huffman_encoding/code/c/huffman.c:224
↓ 1 callersMethoddecoded
contents/huffman_encoding/code/cpp/huffman.cpp:86
↓ 1 callersFunctiondequeue
contents/tree_traversal/code/c/utility.h:92
↓ 1 callersFunctiondequeue
contents/flood_fill/code/c/flood_fill.c:138
↓ 1 callersMethoddequeue
(self)
contents/stacks_and_queues/code/python/queue.py:15
↓ 1 callersMethoddequeue
()
contents/stacks_and_queues/code/typescript/queue.ts:27
↓ 1 callersMethoddequeue
()
contents/stacks_and_queues/code/java/QueueTest.java:54
↓ 1 callersMethoddfs
(&self, code: String, codebook: &mut HashMap<char, String>)
contents/huffman_encoding/code/rust/huffman.rs:113
↓ 1 callersFunctiondfsInorder
(tree)
contents/tree_traversal/code/javascript/tree.js:30
↓ 1 callersFunctiondfsIterative
(tree)
contents/tree_traversal/code/javascript/tree.js:53
↓ 1 callersFunctiondfsPostorder
(tree)
contents/tree_traversal/code/javascript/tree.js:21
↓ 1 callersFunctiondfsPreorder
(tree)
contents/tree_traversal/code/javascript/tree.js:12
↓ 1 callersFunctiondfsRecursive
(n *node)
contents/tree_traversal/code/go/treetraversal.go:10
↓ 1 callersFunctiondfsRecursiveInorderBtree
(n *node)
contents/tree_traversal/code/go/treetraversal.go:24
↓ 1 callersFunctiondfsRecursivePostorder
(n *node)
contents/tree_traversal/code/go/treetraversal.go:17
↓ 1 callersFunctiondfsStack
(n *node)
contents/tree_traversal/code/go/treetraversal.go:40
↓ 1 callersFunctiondfs_recursive
(node)
contents/tree_traversal/code/python/tree_traversal.py:17
↓ 1 callersFunctiondfs_recursive
Simple recursive scheme for DFS
contents/tree_traversal/code/cpp/tree_example.cpp:18
↓ 1 callersFunctiondfs_recursive
(n: &Node)
contents/tree_traversal/code/rust/tree.rs:9
↓ 1 callersFunctiondfs_recursive
contents/tree_traversal/code/c/tree_traversal.c:37
↓ 1 callersFunctiondfs_recursive_inorder_btree
(node)
contents/tree_traversal/code/python/tree_traversal.py:34
↓ 1 callersFunctiondfs_recursive_inorder_btree
contents/tree_traversal/code/cpp/tree_example.cpp:34
↓ 1 callersFunctiondfs_recursive_inorder_btree
(n: &Node)
contents/tree_traversal/code/rust/tree.rs:25
↓ 1 callersFunctiondfs_recursive_inorder_btree
contents/tree_traversal/code/c/tree_traversal.c:55
↓ 1 callersFunctiondfs_recursive_postorder
(node)
contents/tree_traversal/code/python/tree_traversal.py:25
↓ 1 callersFunctiondfs_recursive_postorder
contents/tree_traversal/code/cpp/tree_example.cpp:26
↓ 1 callersFunctiondfs_recursive_postorder
(n: &Node)
contents/tree_traversal/code/rust/tree.rs:17
↓ 1 callersFunctiondfs_recursive_postorder
contents/tree_traversal/code/c/tree_traversal.c:47
↓ 1 callersFunctiondfs_stack
(node)
contents/tree_traversal/code/python/tree_traversal.py:48
↓ 1 callersFunctiondfs_stack
Simple non-recursive scheme for DFS
contents/tree_traversal/code/cpp/tree_example.cpp:55
↓ 1 callersFunctiondfs_stack
(n: &Node)
contents/tree_traversal/code/rust/tree.rs:41
↓ 1 callersFunctiondfs_stack
contents/tree_traversal/code/c/tree_traversal.c:75
↓ 1 callersFunctiondft
(X)
contents/cooley_tukey/code/python/fft.py:6
↓ 1 callersFunctiondft
(x: &[Complex<f64>])
contents/cooley_tukey/code/rust/fft.rs:24
↓ 1 callersFunctiondft
(x)
contents/cooley_tukey/code/javascript/fft.js:3
↓ 1 callersFunctiondrand
Returns a random double in [0, 1)
contents/approximate_counting/code/cpp/approximate_counting.cpp:14
↓ 1 callersFunctiondrand
This function returns a pseudo-random number between 0 and 1
contents/approximate_counting/code/c/approximate_counting.c:8
↓ 1 callersFunctiondrand
Returns a random double in [0, 1)
contents/barnsley/code/cpp/barnsley.cpp:53
↓ 1 callersFunctionencode
(str)
contents/huffman_encoding/code/javascript/huffman.js:1
↓ 1 callersFunctionencode
(message string)
contents/huffman_encoding/code/go/huffman.go:83
↓ 1 callersFunctionencode
contents/huffman_encoding/code/c/huffman.c:208
↓ 1 callersMethodencode
(&self, input: &str)
contents/huffman_encoding/code/rust/huffman.rs:131
↓ 1 callersMethodencode
()
contents/huffman_encoding/code/java/huffman.java:90
↓ 1 callersMethodequals
(Point p)
contents/jarvis_march/code/java/JarvisMarch.java:21
↓ 1 callersFunctioneuclidMod
contents/euclidean_algorithm/code/kotlin/Euclidean.kt:15
↓ 1 callersFunctioneuclidMod
(a, b)
contents/euclidean_algorithm/code/javascript/euclidean_example.js:1
↓ 1 callersFunctioneuclidMod
(a, b int)
contents/euclidean_algorithm/code/go/euclidean.go:14
↓ 1 callersMethodeuclidMod
(int a, int b)
contents/euclidean_algorithm/code/java/EuclideanAlgo.java:18
↓ 1 callersFunctioneuclidSub
contents/euclidean_algorithm/code/kotlin/Euclidean.kt:3
↓ 1 callersFunctioneuclidSub
(a, b)
contents/euclidean_algorithm/code/javascript/euclidean_example.js:15
↓ 1 callersFunctioneuclidSub
(a, b int)
contents/euclidean_algorithm/code/go/euclidean.go:25
↓ 1 callersMethodeuclidSub
(int a, int b)
contents/euclidean_algorithm/code/java/EuclideanAlgo.java:3
↓ 1 callersFunctioneuclid_mod
(a, b)
contents/euclidean_algorithm/code/python/euclidean_example.py:1
↓ 1 callersFunctioneuclid_mod
(int $a, int $b)
contents/euclidean_algorithm/code/php/euclidean.php:20
↓ 1 callersFunctioneuclid_mod
Euclidean algorithm using modulus
contents/euclidean_algorithm/code/cpp/euclidean.cpp:6
↓ 1 callersFunctioneuclid_mod
contents/euclidean_algorithm/code/c/euclidean_example.c:4
← previousnext →201–300 of 774, ranked by callers