Merge branch 'master' into wmboyles-GrahamScan

Author: jiegillet

CONTRIBUTORS.md

@@ -40,3 +40,7 @@ GuyPozner
 <br>
 William Boyles
 <br>
+Max Weinstein
+<br>
+Gibus Wearing Brony
+<br>

README.md

@@ -1,4 +1,11 @@
+> **IMPORTANT NOTE FOR NEW CONTRIBUTORS:**
+>
+> We do **not** yet accept entirely new chapters by everyone. If you would like to start work on one, get in contact with Leios first. If you create a full chapter, including text, and submit it as a pull request it is most likely going to get rejected.
+>
+> If you want to help, it is best to write language examples for *existing* chapters. You can also try to find spelling or other mistakes in existing chapters and submit fixes for those.
+
 # The Arcane Algorithm Archive
+
 The Arcane Algorithm Archive is a collaborative effort to create a guide for all important algorithms in all languages.
 This goal is obviously too ambitious for a book of any size, but it is a great project to learn from and work on and will hopefully become an incredible resource for programmers in the future.
 The book can be found here: https://www.algorithm-archive.org/.
@@ -14,7 +21,7 @@ Unfortunately, this means that we will probably never cover every algorithm ever
 That said, we'll still cover a few algorithms for fun that have very little, if any practical purpose.
 
 If you would like to contribute, feel free to go to any chapter with code associated with it and implement that algorithm in your favorite language,
-and then submit the code via pull request, following the submission guidelines found in `chapters/how_to_contribute.md` (or [here](chapters/how_to_contribute.md) if you are reading this on gitbook).
+and then submit the code via pull request, following the submission guidelines found in `contents/how_to_contribute/how_to_contribute.md` (or [here](contents/how_to_contribute/how_to_contribute.md) if you are reading this on gitbook).
 
 Hopefully, this project will grow and allow individuals to learn about and try their hand at implementing different algorithms for fun and (potentially) useful projects.
 If nothing else, it will be an enjoyable adventure for our community.

SUMMARY.md

@@ -1,54 +1,38 @@
 # Summary
 
 * [Algorithm Archive](README.md)
-* [TODO](TODO.md)
-* [Introduction](chapters/introduction.md)
-* [A Personal Note](chapters/getting_started.md)
-* [How To Contribute](chapters/how_to_contribute.md)
-* [Principles of Code](chapters/principles_of_code/principles_of_code.md)
-    * [Choosing A Language](chapters/principles_of_code/choosing_a_language/choosing_a_language.md)
-        * [Compiled Languages](chapters/principles_of_code/choosing_a_language/compiled/compiled.md)
-            * [Makefiles](chapters/principles_of_code/choosing_a_language/compiled/makefiles.md)
-            * [FORTRAN](chapters/principles_of_code/choosing_a_language/compiled/FORTRAN.md)
-    * [Building Blocks](chapters/principles_of_code/building_blocks/building_blocks.md)
-        * [Variables and Types](chapters/principles_of_code/building_blocks/variables.md)
-        * [Conditions](chapters/principles_of_code/building_blocks/conditions.md)
-        * [Loops](chapters/principles_of_code/building_blocks/loops.md)
-        * [Functions](chapters/principles_of_code/building_blocks/functions.md)
-        * [Classes](chapters/principles_of_code/building_blocks/classes.md)
-        * [Stacks and Queues](chapters/principles_of_code/building_blocks/stacks.md)
-        * [Bit Logic](chapters/principles_of_code/building_blocks/bitlogic.md)
-    * [Version Control](chapters/principles_of_code/version_control.md)
-    * [Complexity Notation](chapters/principles_of_code/notation/notation.md)
-* [Convolutions](chapters/convolutions/convolutions.md)
-* [Taylor Series](chapters/taylor/taylor_series.md)
-* [Sorting and Searching](chapters/sorting_searching/sorting_searching.md)
-    * [Bubble Sort](chapters/sorting_searching/bubble/bubble_sort.md)
-    * [Bogo Sort](chapters/sorting_searching/bogo/bogo_sort.md)
-* [Tree Traversal](chapters/tree_traversal/tree_traversal.md)
-* [Euclidean Algorithm](chapters/euclidean_algorithm/euclidean.md)
-* [Multiplication](chapters/multiplication/multiplication.md)
-* [Monte Carlo](chapters/monte_carlo/monte_carlo.md)
-* [Matrix Methods](chapters/matrix_methods/matrix_methods.md)
-    * [Gaussian Elimination](chapters/matrix_methods/gaussian_elimination/gaussian_elimination.md)
-    * [Thomas Algorithm](chapters/matrix_methods/thomas/thomas.md)
-* [Computational Geometry](chapters/computational_geometry/computational_geometry.md)
-    * [Gift Wrapping](chapters/computational_geometry/gift_wrapping/gift_wrapping.md)
-        * [Jarvis March](chapters/computational_geometry/gift_wrapping/jarvis_march/jarvis_march.md)
-        * [Graham Scan](chapters/computational_geometry/gift_wrapping/graham_scan/graham_scan.md)
-        * [Chan's Algorithm](chapters/computational_geometry/gift_wrapping/chan/chans.md)
-* [FFT](chapters/FFT/cooley_tukey.md)
-* [Decision Problems](chapters/decision_problems/decision_problems.md)
-    * [Stable Marriage Problem](chapters/decision_problems/stable_marriage/stable_marriage.md)
-* [Differential Equation Solvers](chapters/differential_equations/differential_equations.md)
-    * [Forward Euler Method](chapters/differential_equations/euler/euler.md)
-    * [Backward Euler Methods](chapters/differential_equations/euler/backward_euler.md)
-    * [Runge Kutta](chapters/differential_equations/runge_kutta/runge_kutta.md)
-* [Physics Solvers](chapters/physics_solvers/physics_solvers.md)
-    * [Verlet Integration](chapters/physics_solvers/verlet/verlet.md)
-    * [Barnes-Hut](chapters/physics_solvers/barnes_hut.md)
-    * [Quantum Systems](chapters/physics_solvers/quantum/quantum.md)
-        * [Split-Operator Method](chapters/physics_solvers/quantum/split-op/split-op.md)
-* [Data Compression](chapters/data_compression/data_compression.md)
-    * [Huffman Encoding](chapters/data_compression/huffman/huffman.md)
-* [Quantum Information](chapters/QI/QI.md)
+* [Introduction](contents/introduction/introduction.md)
+* [How To Contribute](contents/how_to_contribute/how_to_contribute.md)
+* [Version Control](contents/git_and_version_control/git_and_version_control.md)
+* [Data Structures](contents/data_structures/data_structures.md)
+    * [Stacks and Queues](contents/stacks_and_queues/stacks_and_queues.md)
+* [Mathematical Background](contents/mathematical_background/mathematical_background.md)
+    * [Complexity Notation](contents/notation/notation.md)
+    * [Bit Logic](contents/bitlogic/bitlogic.md)
+    * [Convolutions](contents/convolutions/convolutions.md)
+    * [Taylor Series](contents/taylor_series_expansion/taylor_series_expansion.md)
+* [Sorting and Searching](contents/sorting_and_searching/sorting_and_searching.md)
+    * [Bubble Sort](contents/bubble_sort/bubble_sort.md)
+    * [Bogo Sort](contents/bogo_sort/bogo_sort.md)
+* [Tree Traversal](contents/tree_traversal/tree_traversal.md)
+* [Euclidean Algorithm](contents/euclidean_algorithm/euclidean_algorithm.md)
+* [Monte Carlo](contents/monte_carlo_integration/monte_carlo_integration.md)
+* [Matrix Methods](contents/matrix_methods/matrix_methods.md)
+    * [Gaussian Elimination](contents/gaussian_elimination/gaussian_elimination.md)
+    * [Thomas Algorithm](contents/thomas_algorithm/thomas_algorithm.md)
+* [Computational Geometry](contents/computational_geometry/computational_geometry.md)
+    * [Gift Wrapping](contents/gift_wrapping/gift_wrapping.md)
+        * [Jarvis March](contents/jarvis_march/jarvis_march.md)
+        * [Graham Scan](contents/graham_scan/graham_scan.md)
+* [FFT](contents/cooley_tukey/cooley_tukey.md)
+* [Decision Problems](contents/decision_problems/decision_problems.md)
+    * [Stable Marriage Problem](contents/stable_marriage_problem/stable_marriage_problem.md)
+* [Differential Equation Solvers](contents/differential_equations/differential_equations.md)
+    * [Forward Euler Method](contents/forward_euler_method/forward_euler_method.md)
+* [Physics Solvers](contents/physics_solvers/physics_solvers.md)
+    * [Verlet Integration](contents/verlet_integration/verlet_integration.md)
+    * [Quantum Systems](contents/quantum_systems/quantum_systems.md)
+        * [Split-Operator Method](contents/split-operator_method/split-operator_method.md)
+* [Data Compression](contents/data_compression/data_compression.md)
+    * [Huffman Encoding](contents/huffman_encoding/huffman_encoding.md)
+* [Quantum Information](contents/quantum_information/quantum_information.md)

TODO.md

@@ -8,7 +8,8 @@
     "wordcount",
     "api-language-selector",
     "include-codeblock",
-    "ga"
+    "ga",
+    "bulk-redirect"
   ],
   "lunr": {
     "maxIndexSize": 1000000000
@@ -18,6 +19,10 @@
       "fixlang": true,
       "unindent": true
     },
+    "bulk-redirect": {
+      "basepath": "/",
+      "redirectsFile": "redirects.json"
+    },
     "ga": {
       "token": "UA-118252470-1"
     },
@@ -107,6 +112,10 @@
         {
           "lang": "r",
           "name": "R"
+        },
+        {
+          "lang": "ti83b",
+          "name": "TI-83 Basic"
         }
       ]
     }