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
↓ 2 callersFunctionis_leaf
contents/huffman_encoding/code/c/huffman.c:30
↓ 2 callersMethodmagnitude
()
contents/jarvis_march/code/java/JarvisMarch.java:28
↓ 2 callersFunctionmake_person_list
this function generates a list of people with size `number_of_partners`. each person's `preference_list` will be a randomly sorted list of the nu
contents/stable_marriage_problem/code/cpp/stable_marriage.cpp:42
↓ 2 callersFunctionmetropolis_iterate
Iterate metropolis algorithm for num_steps using iniital position x_0
contents/metropolis/code/python/metropolis.py:34
↓ 2 callersFunctionmod
* In this code, the modulus operator is used. * However, this operator in javascript/typescript doesn't support negative numbers. * So, where there
contents/computus/code/typescript/gauss_easter.ts:8
↓ 2 callersFunctionmod
* @param {number} a * @param {number} b * @returns {number}
contents/computus/code/javascript/gauss_easter.js:13
↓ 2 callersFunctionn
This function takes - v: value in register - a: a scaling value for the logarithm based on Morris's paper It returns n(v,a), the approximate count
contents/approximate_counting/code/rust/approximate_counting.rs:5
↓ 2 callersMethodpartial_cmp
(&self, other: &Self)
contents/graham_scan/code/rust/graham_scan.rs:12
↓ 2 callersMethodpartner
(self)
contents/stable_marriage_problem/code/python/stable_marriage.py:105
↓ 2 callersFunctionpolarAngle
(a, b)
contents/graham_scan/code/javascript/graham-scan.js:32
↓ 2 callersFunctionpolarAngle
(ref, point point)
contents/graham_scan/code/go/graham.go:17
↓ 2 callersFunctionpolar_angle
contents/graham_scan/code/cpp/graham_scan.cpp:22
↓ 2 callersFunctionpolar_angle
Calculate the polar angle of a point relative to a reference point.
contents/graham_scan/code/rust/graham_scan.rs:38
↓ 2 callersMethodpop
(self)
contents/stacks_and_queues/code/python/stack.py:15
↓ 2 callersFunctionprintMatrix
(a)
contents/gaussian_elimination/code/javascript/gaussian_elimination.js:86
↓ 2 callersFunctionprintMatrixRow
(row)
contents/gaussian_elimination/code/javascript/gaussian_elimination.js:78
↓ 2 callersFunctionprintMatrixRow
(row []float64)
contents/gaussian_elimination/code/go/gaussian_elimination.go:100
↓ 2 callersFunctionqueue_empty
contents/tree_traversal/code/c/utility.h:65
↓ 2 callersFunctionrandom_zero_to_one
()
contents/monte_carlo_integration/code/php/monte_carlo.php:9
↓ 2 callersMethodreceiveOptions
(List<? extends Person> mates)
contents/stable_marriage_problem/code/java/stable-marriage.java:93
↓ 2 callersMethodsetPreferences
(array $preferences)
contents/stable_marriage_problem/code/php/stable_marriage.php:21
↓ 2 callersFunctionshuffle
(iterable)
contents/stable_marriage_problem/code/javascript/stable-marriage.js:41
↓ 2 callersMethodsize
()
contents/stacks_and_queues/code/typescript/stack.ts:31
↓ 2 callersMethodsize
()
contents/stacks_and_queues/code/java/QueueTest.java:63
↓ 2 callersFunctionstack_empty
contents/tree_traversal/code/c/utility.h:29
↓ 2 callersFunctionstack_push
contents/tree_traversal/code/c/utility.h:33
↓ 2 callersFunctionstack_push
contents/flood_fill/code/c/flood_fill.c:62
↓ 2 callersFunctionunreachable
contents/huffman_encoding/code/cpp/huffman.cpp:20
↓ 2 callersFunctionwith_new_bit
contents/huffman_encoding/code/cpp/huffman.cpp:94
↓ 1 callersMethodBFSQueue
()
contents/tree_traversal/code/csharp/Tree.cs:102
↓ 1 callersMethodCodeBookReverse
()
contents/huffman_encoding/code/java/huffman.java:84
↓ 1 callersMethodCreateBranch
Creates a branch. Here a node is created by adding the keys and weights of both childs together.
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:38
↓ 1 callersMethodCreateLeaf
Creates a leaf. So just a node is created with the given values.
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:36
↓ 1 callersMethodDFSQueue
(Tree $tree)
contents/tree_traversal/code/php/tree_traversal.php:91
↓ 1 callersMethodDFSRecursive
(Tree $tree)
contents/tree_traversal/code/php/tree_traversal.php:41
↓ 1 callersMethodDFSRecursive
(Tree tree)
contents/tree_traversal/code/csharp/Tree.cs:33
↓ 1 callersMethodDFSRecursiveInorderBinary
(Tree $tree)
contents/tree_traversal/code/php/tree_traversal.php:57
↓ 1 callersMethodDFSRecursiveInorderBinary
(Tree tree)
contents/tree_traversal/code/csharp/Tree.cs:60
↓ 1 callersMethodDFSRecursivePostorder
(Tree $tree)
contents/tree_traversal/code/php/tree_traversal.php:49
↓ 1 callersMethodDFSRecursivePostorder
(Tree tree)
contents/tree_traversal/code/csharp/Tree.cs:46
↓ 1 callersMethodDFSStack
(Tree $tree)
contents/tree_traversal/code/php/tree_traversal.php:78
↓ 1 callersMethodDFSStack
()
contents/tree_traversal/code/csharp/Tree.cs:87
↓ 1 callersMethodDecode
(EncodingResult result)
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:90
↓ 1 callersMethodEncode
(string input)
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:81
↓ 1 callersMethodEquals
(object obj)
contents/jarvis_march/code/csharp/JarvisMarch.cs:19
↓ 1 callersMethodEuclidMod
(int a, int b)
contents/euclidean_algorithm/code/csharp/EuclideanAlgorithm.cs:25
↓ 1 callersMethodEuclidSub
(int a, int b)
contents/euclidean_algorithm/code/csharp/EuclideanAlgorithm.cs:8
↓ 1 callersMethodIsInMe
(Point point)
contents/monte_carlo_integration/code/csharp/Circle.cs:23
↓ 1 callersMethodLen
()
contents/huffman_encoding/code/go/huffman.go:18
↓ 1 callersMethodNormalize
Normalizes the given array.
contents/convolutions/1d/code/csharp/1DConvolution.cs:18
↓ 1 callersMethodProposeToNext
()
contents/stable_marriage_problem/code/csharp/Person.cs:19
↓ 1 callersMethodRun
(List<Vector> points)
contents/jarvis_march/code/csharp/JarvisMarch.cs:28
↓ 1 callersMethodRun
(int samples)
contents/monte_carlo_integration/code/csharp/MonteCarlo.cs:7
↓ 1 callersMethodRunGaleShapleyAlgorithm
(List<TFollow> follows, List<TLead> leads)
contents/stable_marriage_problem/code/csharp/GaleShapleyAlgorithm.cs:10
↓ 1 callersFunction_detect
(env)
builders/coconut.py:12
↓ 1 callersFunction_detect
(env)
builders/mcs.py:12
↓ 1 callersFunction_detect
(env)
builders/cargo.py:13
↓ 1 callersFunction_detect
(env)
builders/go.py:12
↓ 1 callersFunction_detect
(env)
builders/rustc.py:12
↓ 1 callersFunction_detect
(env)
builders/racket.py:12
↓ 1 callersMethodaddChild
(Tree $child)
contents/tree_traversal/code/php/tree_traversal.php:25
↓ 1 callersMethodapproximateCount
(int nItems, double a)
contents/approximate_counting/code/java/ApproximateCounting.java:41
↓ 1 callersFunctionapproximate_count
(n_items, a)
contents/approximate_counting/code/python/approximate_counting.py:25
↓ 1 callersFunctionapproximate_count
This simulates counting and takes - n_items: number of items to count and loop over - a: a scaling value for the logarithm based on Morris's paper It
contents/approximate_counting/code/cpp/approximate_counting.cpp:38
↓ 1 callersFunctionapproximate_count
This simulates counting and takes - n_items: number of items to count and loop over - a: a scaling value for the logarithm based on Morris's paper It
contents/approximate_counting/code/rust/approximate_counting.rs:29
↓ 1 callersFunctionapproximate_count
This function simulates counting and takes - n_items: number of items to count and loop over - a: a scaling value for the logarithm based on Morris's
contents/approximate_counting/code/c/approximate_counting.c:41
↓ 1 callersFunctionbackSubs
contents/gaussian_elimination/code/cpp/gaussian_elimination.cpp:56
↓ 1 callersFunctionbackSubstitution
(a)
contents/gaussian_elimination/code/javascript/gaussian_elimination.js:40
↓ 1 callersFunctionbackSubstitution
(a [][]float64)
contents/gaussian_elimination/code/go/gaussian_elimination.go:84
↓ 1 callersMethodbackSubstitution
(double[][] a)
contents/gaussian_elimination/code/java/GaussianElimination.java:72
↓ 1 callersFunctionback_substitution
(A)
contents/gaussian_elimination/code/python/gaussian_elimination.py:53
↓ 1 callersFunctionback_substitution
(a: &Matrix)
contents/gaussian_elimination/code/rust/gaussian_elimination.rs:98
↓ 1 callersFunctionback_substitution
contents/gaussian_elimination/code/c/gaussian_elimination.c:50
↓ 1 callersFunctionbfs
(tree)
contents/tree_traversal/code/javascript/tree.js:62
↓ 1 callersFunctionbfsQueue
(n *node)
contents/tree_traversal/code/go/treetraversal.go:51
↓ 1 callersFunctionbfs_queue
(node)
contents/tree_traversal/code/python/tree_traversal.py:55
↓ 1 callersFunctionbfs_queue
simple non-recursive scheme for BFS
contents/tree_traversal/code/cpp/tree_example.cpp:73
↓ 1 callersFunctionbfs_queue
(n: &Node)
contents/tree_traversal/code/rust/tree.rs:50
↓ 1 callersFunctionbfs_queue
contents/tree_traversal/code/c/tree_traversal.c:95
↓ 1 callersFunctionbit_reverse
(X)
contents/cooley_tukey/code/python/fft.py:29
↓ 1 callersFunctionbit_reverse
(x: &[Complex<f64>])
contents/cooley_tukey/code/rust/fft.rs:57
↓ 1 callersFunctionbit_reverse
(x)
contents/cooley_tukey/code/javascript/fft.js:50
↓ 1 callersFunctionbit_reverse
contents/cooley_tukey/code/c/fft.c:58
↓ 1 callersFunctionbit_reverse_idxs
(n)
contents/cooley_tukey/code/javascript/fft.js:41
↓ 1 callersFunctionbuildTree
(message string)
contents/huffman_encoding/code/go/huffman.go:38
↓ 1 callersFunctionbuild_codebook
(tree, code='')
contents/huffman_encoding/code/python/huffman.py:37
↓ 1 callersFunctionbuild_huffman_tree
(message)
contents/huffman_encoding/code/python/huffman.py:8
↓ 1 callersFunctioncalculate_energy
Calculate the energy <Psi|H|Psi>.
contents/split-operator_method/code/python/split_op.py:98
↓ 1 callersFunctioncalculate_energy
contents/split-operator_method/code/cpp/split_op.cpp:158
↓ 1 callersFunctioncalculate_energy
contents/split-operator_method/code/c/split_op.c:150
↓ 1 callersFunctionccw
(p1, p2, p3)
contents/jarvis_march/code/python/jarvis_march.py:2
↓ 1 callersFunctionccw
contents/graham_scan/code/cpp/graham_scan.cpp:18
↓ 1 callersFunctionccw
(a, b, c)
contents/graham_scan/code/javascript/graham-scan.js:36
↓ 1 callersFunctionccw
contents/graham_scan/code/c/graham.c:24
↓ 1 callersMethodccw
(Point a, Point b, Point c)
contents/graham_scan/code/java/GrahamScan.java:27
↓ 1 callersFunctionchaosGame
This is a function to simulate a "chaos game"
contents/IFS/code/cpp/IFS.cpp:40
↓ 1 callersMethodchaosGame
(int n, Point initialLocation, double[][][] hutchinsonOp, double[] probabilities)
contents/barnsley/code/java/Barnsley.java:59
↓ 1 callersMethodchaosGame
(int n, Point[] shapePoints)
contents/IFS/code/java/IFS.java:16
↓ 1 callersFunctionchaos_game
This is a general function to simulate a chaos game n is the number of iterations initial_location is the the starting point of the chaos game hutchin
contents/barnsley/code/cpp/barnsley.cpp:87
↓ 1 callersFunctionchaos_game
( iters: usize, initial_location: Point2, hutchinson_op: &[Vec<Point3>], probabilities: &[f64]
contents/barnsley/code/rust/barnsley.rs:42
← previousnext →101–200 of 774, ranked by callers