diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html index 81eb0637..4005bfef 100644 --- a/d4/d68/qr__decompose_8h_source.html +++ b/d4/d68/qr__decompose_8h_source.html @@ -384,6 +384,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
MAX_LEN
#define MAX_LEN
length of resulting recurring fraction number
Definition: sol1.c:15
node
struct Node node
Node, the basic data structure of the tree.
search
void search(node *root, int ele)
searches for the element
Definition: threaded_binary_trees.c:98
+
test
void test(void)
Test function to save resulting points to a CSV file.
Definition: spirograph.c:74
max
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_trace.c:32
OKbox
bool OKbox(const struct sudoku *a, int x, int y, int v)
Check if a 3x3 box is valid.
Definition: sudoku_solver.c:85
gcd
unsigned long gcd(unsigned long a, unsigned long b)
Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.
Definition: sol.c:11
@@ -408,7 +409,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
kohonen_array_3d::dim1
int dim1
lengths of first dimension
Definition: kohonen_som_topology.c:49
func
double complex func(double complex x)
Return value of the function to find the root for.
Definition: newton_raphson_root.c:22
sudoku::a
uint8_t * a
matrix as a flattened 1D row-major array
Definition: sudoku_solver.c:34
-
test
void test()
Test implementations.
Definition: binary_search.c:75
test1
void test1(double eta)
test function to predict points in a 2D coordinate system above the line as +1 and others as -1.
Definition: adaline_learning.c:225
test2
void test2(double eta)
test function to predict points in a 2D coordinate system above the line as +1 and others as -1.
Definition: adaline_learning.c:273
ACCURACY
#define ACCURACY
maximum accuracy limit
Definition: durand_kerner_roots.c:41
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 932d92b2..b072abfd 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -244,18 +244,23 @@ Exercism

+Graphics

+ +

Greedy Approach

-

+

Hash

-

+

Leetcode

-

+

Machine Learning

-

+

Misc

-

+

Numerical Methods

-

+

Project Euler

-

+

Searching

-

+

Sorting

diff --git a/globals_defs.html b/globals_defs.html index 29092fe0..0e1b8e66 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -92,7 +92,8 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(