update

Author: Trashtalk217

CONTRIBUTORS.md

@@ -43,3 +43,5 @@ This file lists everyone, who contributed to this repo and wanted to show up her
 - Vexatos
 - Björn Heinrichs 
 - Olav Sundfør
+- dovisutu
+- Antetokounpo

contents/cooley_tukey/code/julia/fft.jl

@@ -110,23 +110,17 @@ function butterfly(x)
     return y
 end
 
-function approx(x, y)
-    val = true
-    for i = 1:length(x)
-        if (abs(x[i]) - abs(y[i]) > 1e-5)
-            val = false
-        end
-    end
-    println(val)
-end
-
 function main()
     x = rand(128)
     y = cooley_tukey(x)
     z = iterative_cooley_tukey(x)
     w = fft(x)
-    approx(y, w)
-    approx(z, w)
+    if(isapprox(y, w))
+        println("Recursive Cooley Tukey matches fft() from FFTW package.")
+    end
+    if(isapprox(z, w))
+        println("Iterative Cooley Tukey matches fft() from FFTW package.")
+    end
 end
 
 main()

contents/graham_scan/code/julia/graham.jl

@@ -47,7 +47,7 @@ end
 function main()
     # This hull is just a simple test so we know what the output should be
     points = [
-        Point(-5.,2), Point(5,7), Point(-6,-12), Point(-14,-14), Point(9,9),
+        Point(-5,2), Point(5,7), Point(-6,-12), Point(-14,-14), Point(9,9),
         Point(-1,-1), Point(-10,11), Point(-6,15), Point(-6,-8), Point(15,-9),
         Point(7,-7), Point(-2,-9), Point(6,-5), Point(0,14), Point(2,8)
     ]

contents/jarvis_march/code/jarvis.jl

@@ -32,7 +32,7 @@ void dfs_recursive_postorder(node const& n) {
 
 
 void dfs_recursive_inorder_btree(node const& n) {
-  switch (n.children_size) {
+  switch (n.children.size()) {
     case 2:
       dfs_recursive_inorder_btree(n.children[0]);
       std::cout << n.value << '\n';
@@ -92,16 +92,16 @@ node create_tree(size_t num_row, size_t num_child) {
 
   std::vector<node> vec;
   std::generate_n(std::back_inserter(vec), num_child, [&] {
-    return create_node(num_row - 1, num_child);
+    return create_tree(num_row - 1, num_child);
   });
 
   return node{std::move(vec), num_row};
 }
 
 int main() {
   // Creating Tree in main
-  auto root = create_node(3, 3);
-  auto binary_root = create_node(3, 2);
+  auto root = create_tree(3, 3);
+  auto binary_root = create_tree(3, 2);
   std::cout << "DFS recursive:\n";
   dfs_recursive(root);
   std::cout << "DFS post order recursive:\n";