Merge branch 'master' into devcontainer-vlang

Author: ShadowMitia

.devcontainer/Dockerfile

@@ -6,7 +6,7 @@ FROM mcr.microsoft.com/vscode/devcontainers/base:0-${VARIANT}
 
 # [Optional] Uncomment this section to install additional OS packages.
 RUN apt-get update && export DEBIAN_FRONTEND=noninteractive \
-    && apt-get -y install --no-install-recommends build-essential software-properties-common xz-utils g++ sbcl julia python3 python3-pip python3-dev ghc openjdk-11-jdk rustc libssl-dev gfortran libxml2-dev libyaml-dev libgmp-dev libz-dev libncurses5 gnuplot nodejs npm lua5.3 ocaml php ruby-full gnu-smalltalk scratch
+    && apt-get -y install --no-install-recommends build-essential software-properties-common xz-utils g++ sbcl julia python3 python3-pip python3-dev ghc openjdk-11-jdk rustc libssl-dev gfortran libxml2-dev libyaml-dev libgmp-dev libz-dev libncurses5 gnuplot nodejs npm lua5.3 ocaml php ruby-full gnu-smalltalk scratch libfftw3-dev
 
 # Setup Crystal
 RUN echo 'deb http://download.opensuse.org/repositories/devel:/languages:/crystal/xUbuntu_20.04/ /' | sudo tee /etc/apt/sources.list.d/devel:languages:crystal.list
@@ -99,6 +99,7 @@ ENV PATH=$PATH:~/vlang/v
 RUN apt-get update && export DEBIAN_FRONTEND=noninteractive \
     && apt-get -y install --no-install-recommends crystal dart nim powershell scala dotnet-sdk-5.0 r-base racket
 
-RUN pip install wheel matplotlib numpy coconut
+RUN pip install wheel matplotlib numpy coconut scons
 
 RUN sudo sh -c 'npm install -g typescript'
+

.gitignore

@@ -517,3 +517,10 @@ vscode/
 
 # aspell
 *.bak
+
+# SCons intermidiate files
+.sconsign.dblite
+*.o
+
+# SCons build directory
+build/

CONTRIBUTORS.md

@@ -51,7 +51,7 @@ This file lists everyone, who contributed to this repo and wanted to show up her
 - Vincent Zalzal
 - Jonathan D B Van Schenck
 - James Goytia
-- Amaras
+- Sammy Plat 
 - Jonathan Dönszelmann
 - Ishaan Verma
 - Delphi1024

SConscript

@@ -0,0 +1,10 @@
+from pathlib import Path
+
+Import('*')
+
+for p in Path('contents').iterdir():
+    if (q := (p / 'code')).exists():
+        for path in q.iterdir():
+            if path.stem in languages:
+                env.SConscript(path / 'SConscript', exports='env',
+                               must_exist=0)

SConstruct

@@ -0,0 +1,20 @@
+"""
+SCons top-level build description (SConstruct) for the Arcane Algorithm Achive
+
+This provides Builder objects for each of the language implementations in the AAA; however, this work cannot be considered exhaustive until every language has been covered.
+
+Currently, the aim is to provide a way to compile or copy the implementation files to the build directory, as well as to provide ways to run them and capture their output.
+
+To run the compilation for all implmeentations in one language, e.g. Rust, run the command `scons build/c`, and the resulting executables will be available in the `cuild/c` directory, each in their respective algorithm directory, containing the executable."""
+
+from pathlib import Path
+
+env = Environment()
+
+# Add other languages here when you want to add language targets
+languages = ['c']
+
+env.C = env.Program
+
+SConscript('SConscript', exports='env languages')
+

contents/IFS/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/approximate_counting/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'), LIBS='m')

contents/barnsley/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/computus/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/cooley_tukey/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'), LIBS=['m', 'fftw3'])

contents/cooley_tukey/cooley_tukey.md

@@ -81,8 +81,6 @@ For some reason, though, putting code to this transformation really helped me fi
 [import:7-13, lang:"haskell"](code/haskell/fft.hs)
 {% sample lang="py" %}
 [import:6-12, lang:"python"](code/python/fft.py)
-{% sample lang="scratch" %}
-[import:4-13, lang:"julia"](code/julia/fft.jl)
 {% sample lang="asm-x64" %}
 [import:15-74, lang:"asm-x64"](code/asm-x64/fft.s)
 {% sample lang="js" %}
@@ -136,8 +134,6 @@ In the end, the code looks like:
 [import:15-28, lang:"haskell"](code/haskell/fft.hs)
 {% sample lang="py" %}
 [import:15-26, lang:"python"](code/python/fft.py)
-{% sample lang="scratch" %}
-[import:16-32, lang:"julia"](code/julia/fft.jl)
 {% sample lang="asm-x64" %}
 [import:76-165, lang:"asm-x64"](code/asm-x64/fft.s)
 {% sample lang="js" %}
@@ -251,8 +247,6 @@ Note: I implemented this in Julia because the code seems more straightforward in
 [import, lang:"haskell"](code/haskell/fft.hs)
 {% sample lang="py" %}
 [import, lang:"python"](code/python/fft.py)
-{% sample lang="scratch" %}
-Some rather impressive scratch code was submitted by Jie and can be found here: https://scratch.mit.edu/projects/37759604/#editor
 {% sample lang="asm-x64" %}
 [import, lang:"asm-x64"](code/asm-x64/fft.s)
 {% sample lang="js" %}

contents/euclidean_algorithm/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/flood_fill/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/forward_euler_method/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'), LIBS='m')

contents/gaussian_elimination/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/graham_scan/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'), LIBS='m')

contents/huffman_encoding/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/jarvis_march/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/monte_carlo_integration/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/split-operator_method/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'), LIBS=['m', 'fftw3'])

contents/stable_marriage_problem/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/thomas_algorithm/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/tree_traversal/code/c++/tree_example.cpp

@@ -17,7 +17,7 @@ struct node {
 // Simple recursive scheme for DFS
 void dfs_recursive(node const& n) {
   // Here we are doing something...
-  std::cout << n.value << '\n';
+  std::cout << n.value << ' ';
   for (auto const& child : n.children) {
     dfs_recursive(child);
   }
@@ -27,23 +27,23 @@ void dfs_recursive_postorder(node const& n) {
   for (auto const& child : n.children) {
     dfs_recursive_postorder(child);
   }
-  std::cout << n.value << '\n';
+  std::cout << n.value << ' ';
 }
 
 
 void dfs_recursive_inorder_btree(node const& n) {
   switch (n.children.size()) {
     case 2:
       dfs_recursive_inorder_btree(n.children[0]);
-      std::cout << n.value << '\n';
+      std::cout << n.value << ' ';
       dfs_recursive_inorder_btree(n.children[1]);
       break;
     case 1:
       dfs_recursive_inorder_btree(n.children[0]);
-      std::cout << n.value << '\n';
+      std::cout << n.value << ' ';
       break;
     case 0:
-      std::cout << n.value << '\n';
+      std::cout << n.value << ' ';
       break;
     default:
       std::cout << "This is not a binary tree.\n";
@@ -61,7 +61,7 @@ void dfs_stack(node const& n) {
   while (stack.size() > 0) {
     auto const& temp = *stack.top();
     stack.pop();
-    std::cout << temp.value << '\n';
+    std::cout << temp.value << ' ';
 
     for (auto const& child : temp.children) {
       stack.push(&child);
@@ -78,7 +78,7 @@ void bfs_queue(node const& n) {
     auto const& temp = *queue.front();
     queue.pop();
 
-    std::cout << temp.value << '\n';
+    std::cout << temp.value << ' ';
     for (auto const& child : temp.children) {
       queue.push(&child);
     }
@@ -100,18 +100,23 @@ node create_tree(size_t num_row, size_t num_child) {
 
 int main() {
   // Creating Tree in main
-  auto root = create_tree(3, 3);
+  auto root = create_tree(2, 3);
   auto binary_root = create_tree(3, 2);
-  std::cout << "DFS recursive:\n";
+  std::cout << "[#]\nRecursive DFS:\n";
   dfs_recursive(root);
-  std::cout << "DFS post order recursive:\n";
+  std::cout << '\n';
+  std::cout << "[#]\nRecursive Postorder DFS:\n";
   dfs_recursive_postorder(root);
-  std::cout << "DFS inorder binary tree:\n";
-  dfs_recursive_inorder_btree(binary_root);
-  std::cout << "DFS stack:\n";
+  std::cout << '\n';
+  std::cout << "[#]\nStack-based DFS:\n";
   dfs_stack(root);
-  std::cout << "BFS queue:\n";
+  std::cout << '\n';
+  std::cout << "[#]\nQueue-based BFS:\n";
   bfs_queue(root);
+  std::cout << '\n';
+  std::cout << "[#]\nRecursive Inorder DFS for Binary Tree:\n";
+  dfs_recursive_inorder_btree(binary_root);
+  std::cout << '\n';
 
   return 0;
 }

contents/tree_traversal/code/c/SConscript

@@ -0,0 +1,6 @@
+Import('*')
+from pathlib import Path
+
+dirname = Path.cwd().parents[1].stem
+
+env.C(f'#/build/c/{dirname}', Glob('*.c'))

contents/tree_traversal/code/c/tree_traversal.c

@@ -35,7 +35,7 @@ void destroy_tree(struct node n) {
 }
 
 void dfs_recursive(struct node n) {
-    printf("%d\n", n.id);
+    printf("%d ", n.id);
 
     if (n.children) {
         for (size_t i = 0; i < n.children_size; ++i) {
@@ -49,22 +49,22 @@ void dfs_recursive_postorder(struct node n) {
         dfs_recursive_postorder(n.children[i]);
     }
 
-    printf("%d\n", n.id);
+    printf("%d ", n.id);
 }
 
 void dfs_recursive_inorder_btree(struct node n) {
     switch (n.children_size) {
     case 2:
         dfs_recursive_inorder_btree(n.children[0]);
-        printf("%d\n", n.id);
+        printf("%d ", n.id);
         dfs_recursive_inorder_btree(n.children[1]);
         break;
     case 1:
         dfs_recursive_inorder_btree(n.children[0]);
-        printf("%d\n", n.id);
+        printf("%d ", n.id);
         break;
     case 0:
-        printf("%d\n", n.id);
+        printf("%d ", n.id);
         break;
     default:
         printf("This is not a binary tree.\n");
@@ -83,7 +83,7 @@ void dfs_stack(struct node n) {
             break;
         }
 
-        printf("%d\n", tmp->id);
+        printf("%d ", tmp->id);
         for (size_t i = 0; i < tmp->children_size; ++i) {
             stack_push(&stk, &tmp->children[i]);
         }
@@ -103,7 +103,7 @@ void bfs_queue(struct node n) {
             break;
         }
 
-        printf("%d\n", tmp->id);
+        printf("%d ", tmp->id);
         for (size_t i = 0; i < tmp->children_size; ++i) {
             enqueue(&q, &tmp->children[i]);
         }
@@ -113,9 +113,31 @@ void bfs_queue(struct node n) {
 }
 
 int main() {
-    struct node root = create_tree(3, 3);
+    struct node root = create_tree(2, 3);
+
+    printf("[#]\nRecursive DFS:\n");
+    dfs_recursive(root);
+    printf("\n");
+    
+    printf("[#]\nRecursive Postorder DFS:\n");
+    dfs_recursive_postorder(root);
+    printf("\n");
+    
+    printf("[#]\nStack-based DFS:\n");
+    dfs_stack(root);
+    printf("\n");
+    
+    printf("[#]\nQueue-based BFS:\n");
     bfs_queue(root);
+    printf("\n");
+    
     destroy_tree(root);
+    struct node root_binary = create_tree(3, 2);
 
+    printf("[#]\nRecursive Inorder DFS for Binary Tree:\n");
+    dfs_recursive_inorder_btree(root_binary);
+    printf("\n");
+    
+    destroy_tree(root_binary);
     return 0;
 }