diff --git a/README.md b/README.md index 8f0abad24..50d27c79b 100644 --- a/README.md +++ b/README.md @@ -21,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/introduction/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. diff --git a/SUMMARY.md b/SUMMARY.md index a498a9838..569142807 100644 --- a/SUMMARY.md +++ b/SUMMARY.md @@ -1,38 +1,38 @@ # Summary * [Algorithm Archive](README.md) -* [Introduction](chapters/introduction/introduction.md) -* [How To Contribute](chapters/introduction/how_to_contribute.md) -* [Version Control](chapters/introduction/version_control.md) -* [Data Structures](chapters/data_structures/data_structures.md) - * [Stacks and Queues](chapters/data_structures/stacks_and_queues/stacks_and_queues.md) -* [Mathematical Background](chapters/general/mathematical_background/mathematical_background.md) - * [Complexity Notation](chapters/general/notation/notation.md) - * [Bit Logic](chapters/general/bitlogic/bitlogic.md) - * [Convolutions](chapters/algorithms/convolutions/convolutions.md) - * [Taylor Series](chapters/general/taylor_series_expansion/taylor_series_expansion.md) -* [Sorting and Searching](chapters/general/sorting_and_searching/sorting_and_searching.md) - * [Bubble Sort](chapters/algorithms/bubble_sort/bubble_sort.md) - * [Bogo Sort](chapters/algorithms/bogo_sort/bogo_sort.md) -* [Tree Traversal](chapters/algorithms/tree_traversal/tree_traversal.md) -* [Euclidean Algorithm](chapters/algorithms/euclidean_algorithm/euclidean_algorithm.md) -* [Monte Carlo](chapters/algorithms/monte_carlo_integration/monte_carlo_integration.md) -* [Matrix Methods](chapters/general/matrix_methods/matrix_methods.md) - * [Gaussian Elimination](chapters/algorithms/gaussian_elimination/gaussian_elimination.md) - * [Thomas Algorithm](chapters/algorithms/thomas_algorithm/thomas_algorithm.md) -* [Computational Geometry](chapters/general/computational_geometry/computational_geometry.md) - * [Gift Wrapping](chapters/general/gift_wrapping/gift_wrapping.md) - * [Jarvis March](chapters/algorithms/jarvis_march/jarvis_march.md) - * [Graham Scan](chapters/algorithms/graham_scan/graham_scan.md) -* [FFT](chapters/algorithms/cooley_tukey/cooley_tukey.md) -* [Decision Problems](chapters/general/decision_problems/decision_problems.md) - * [Stable Marriage Problem](chapters/algorithms/stable_marriage_problem/stable_marriage_problem.md) -* [Differential Equation Solvers](chapters/general/differential_equations/differential_equations.md) - * [Forward Euler Method](chapters/algorithms/forward_euler_method/forward_euler_method.md) -* [Physics Solvers](chapters/general/physics_solvers/physics_solvers.md) - * [Verlet Integration](chapters/algorithms/verlet_integration/verlet_integration.md) - * [Quantum Systems](chapters/general/quantum_systems/quantum_systems.md) - * [Split-Operator Method](chapters/algorithms/split-operator_method/split-operator_method.md) -* [Data Compression](chapters/general/data_compression/data_compression.md) - * [Huffman Encoding](chapters/algorithms/huffman_encoding/huffman_encoding.md) -* [Quantum Information](chapters/general/quantum_information/quantum_information.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) diff --git a/chapters/algorithms/backward_euler_method/backward_euler_method.md b/contents/backward_euler_method/backward_euler_method.md similarity index 100% rename from chapters/algorithms/backward_euler_method/backward_euler_method.md rename to contents/backward_euler_method/backward_euler_method.md diff --git a/chapters/algorithms/barnes_hut_algorithm/barnes_hut_algorithm.md b/contents/barnes_hut_algorithm/barnes_hut_algorithm.md similarity index 100% rename from chapters/algorithms/barnes_hut_algorithm/barnes_hut_algorithm.md rename to contents/barnes_hut_algorithm/barnes_hut_algorithm.md diff --git a/chapters/general/bitlogic/bitlogic.md b/contents/bitlogic/bitlogic.md similarity index 100% rename from chapters/general/bitlogic/bitlogic.md rename to contents/bitlogic/bitlogic.md diff --git a/chapters/general/bitlogic/res/and.jpg b/contents/bitlogic/res/and.jpg similarity index 100% rename from chapters/general/bitlogic/res/and.jpg rename to contents/bitlogic/res/and.jpg diff --git a/chapters/general/bitlogic/res/nand.jpg b/contents/bitlogic/res/nand.jpg similarity index 100% rename from chapters/general/bitlogic/res/nand.jpg rename to contents/bitlogic/res/nand.jpg diff --git a/chapters/general/bitlogic/res/nor.jpg b/contents/bitlogic/res/nor.jpg similarity index 100% rename from chapters/general/bitlogic/res/nor.jpg rename to contents/bitlogic/res/nor.jpg diff --git a/chapters/general/bitlogic/res/not.jpg b/contents/bitlogic/res/not.jpg similarity index 100% rename from chapters/general/bitlogic/res/not.jpg rename to contents/bitlogic/res/not.jpg diff --git a/chapters/general/bitlogic/res/or.jpg b/contents/bitlogic/res/or.jpg similarity index 100% rename from chapters/general/bitlogic/res/or.jpg rename to contents/bitlogic/res/or.jpg diff --git a/chapters/general/bitlogic/res/xor.jpg b/contents/bitlogic/res/xor.jpg similarity index 100% rename from chapters/general/bitlogic/res/xor.jpg rename to contents/bitlogic/res/xor.jpg diff --git a/chapters/algorithms/bogo_sort/bogo_sort.md b/contents/bogo_sort/bogo_sort.md similarity index 100% rename from chapters/algorithms/bogo_sort/bogo_sort.md rename to contents/bogo_sort/bogo_sort.md diff --git a/chapters/algorithms/bogo_sort/code/c++/bogosort.cpp b/contents/bogo_sort/code/c++/bogosort.cpp similarity index 100% rename from chapters/algorithms/bogo_sort/code/c++/bogosort.cpp rename to contents/bogo_sort/code/c++/bogosort.cpp diff --git a/chapters/algorithms/bogo_sort/code/c/bogo_sort.c b/contents/bogo_sort/code/c/bogo_sort.c similarity index 100% rename from chapters/algorithms/bogo_sort/code/c/bogo_sort.c rename to contents/bogo_sort/code/c/bogo_sort.c diff --git a/chapters/algorithms/bogo_sort/code/clojure/bogo.clj b/contents/bogo_sort/code/clojure/bogo.clj similarity index 100% rename from chapters/algorithms/bogo_sort/code/clojure/bogo.clj rename to contents/bogo_sort/code/clojure/bogo.clj diff --git a/chapters/algorithms/bogo_sort/code/csharp/BogoSort.cs b/contents/bogo_sort/code/csharp/BogoSort.cs similarity index 100% rename from chapters/algorithms/bogo_sort/code/csharp/BogoSort.cs rename to contents/bogo_sort/code/csharp/BogoSort.cs diff --git a/chapters/algorithms/bogo_sort/code/csharp/Program.cs b/contents/bogo_sort/code/csharp/Program.cs similarity index 100% rename from chapters/algorithms/bogo_sort/code/csharp/Program.cs rename to contents/bogo_sort/code/csharp/Program.cs diff --git a/chapters/algorithms/bogo_sort/code/haskell/bogoSort.hs b/contents/bogo_sort/code/haskell/bogoSort.hs similarity index 100% rename from chapters/algorithms/bogo_sort/code/haskell/bogoSort.hs rename to contents/bogo_sort/code/haskell/bogoSort.hs diff --git a/chapters/algorithms/bogo_sort/code/java/bogo.java b/contents/bogo_sort/code/java/bogo.java similarity index 100% rename from chapters/algorithms/bogo_sort/code/java/bogo.java rename to contents/bogo_sort/code/java/bogo.java diff --git a/chapters/algorithms/bogo_sort/code/javascript/bogo.js b/contents/bogo_sort/code/javascript/bogo.js similarity index 100% rename from chapters/algorithms/bogo_sort/code/javascript/bogo.js rename to contents/bogo_sort/code/javascript/bogo.js diff --git a/chapters/algorithms/bogo_sort/code/julia/bogo.jl b/contents/bogo_sort/code/julia/bogo.jl similarity index 100% rename from chapters/algorithms/bogo_sort/code/julia/bogo.jl rename to contents/bogo_sort/code/julia/bogo.jl diff --git a/chapters/algorithms/bogo_sort/code/matlab/bogosort.m b/contents/bogo_sort/code/matlab/bogosort.m similarity index 100% rename from chapters/algorithms/bogo_sort/code/matlab/bogosort.m rename to contents/bogo_sort/code/matlab/bogosort.m diff --git a/chapters/algorithms/bogo_sort/code/python/bogo.py b/contents/bogo_sort/code/python/bogo.py similarity index 100% rename from chapters/algorithms/bogo_sort/code/python/bogo.py rename to contents/bogo_sort/code/python/bogo.py diff --git a/chapters/algorithms/bogo_sort/code/rust/bogosort.rs b/contents/bogo_sort/code/rust/bogosort.rs similarity index 100% rename from chapters/algorithms/bogo_sort/code/rust/bogosort.rs rename to contents/bogo_sort/code/rust/bogosort.rs diff --git a/chapters/algorithms/bogo_sort/code/swift/bogosort.swift b/contents/bogo_sort/code/swift/bogosort.swift similarity index 100% rename from chapters/algorithms/bogo_sort/code/swift/bogosort.swift rename to contents/bogo_sort/code/swift/bogosort.swift diff --git a/chapters/algorithms/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md similarity index 100% rename from chapters/algorithms/bubble_sort/bubble_sort.md rename to contents/bubble_sort/bubble_sort.md diff --git a/chapters/algorithms/bubble_sort/code/c++/bubblesort.cpp b/contents/bubble_sort/code/c++/bubblesort.cpp similarity index 100% rename from chapters/algorithms/bubble_sort/code/c++/bubblesort.cpp rename to contents/bubble_sort/code/c++/bubblesort.cpp diff --git a/chapters/algorithms/bubble_sort/code/c/bubble_sort.c b/contents/bubble_sort/code/c/bubble_sort.c similarity index 100% rename from chapters/algorithms/bubble_sort/code/c/bubble_sort.c rename to contents/bubble_sort/code/c/bubble_sort.c diff --git a/chapters/algorithms/bubble_sort/code/csharp/BubbleSort.cs b/contents/bubble_sort/code/csharp/BubbleSort.cs similarity index 100% rename from chapters/algorithms/bubble_sort/code/csharp/BubbleSort.cs rename to contents/bubble_sort/code/csharp/BubbleSort.cs diff --git a/chapters/algorithms/bubble_sort/code/csharp/Program.cs b/contents/bubble_sort/code/csharp/Program.cs similarity index 100% rename from chapters/algorithms/bubble_sort/code/csharp/Program.cs rename to contents/bubble_sort/code/csharp/Program.cs diff --git a/chapters/algorithms/bubble_sort/code/d/bubble_sort.d b/contents/bubble_sort/code/d/bubble_sort.d similarity index 100% rename from chapters/algorithms/bubble_sort/code/d/bubble_sort.d rename to contents/bubble_sort/code/d/bubble_sort.d diff --git a/chapters/algorithms/bubble_sort/code/go/bubbleSort.go b/contents/bubble_sort/code/go/bubbleSort.go similarity index 100% rename from chapters/algorithms/bubble_sort/code/go/bubbleSort.go rename to contents/bubble_sort/code/go/bubbleSort.go diff --git a/chapters/algorithms/bubble_sort/code/haskell/bubbleSort.hs b/contents/bubble_sort/code/haskell/bubbleSort.hs similarity index 100% rename from chapters/algorithms/bubble_sort/code/haskell/bubbleSort.hs rename to contents/bubble_sort/code/haskell/bubbleSort.hs diff --git a/chapters/algorithms/bubble_sort/code/java/bubble.java b/contents/bubble_sort/code/java/bubble.java similarity index 100% rename from chapters/algorithms/bubble_sort/code/java/bubble.java rename to contents/bubble_sort/code/java/bubble.java diff --git a/chapters/algorithms/bubble_sort/code/javascript/bubble.js b/contents/bubble_sort/code/javascript/bubble.js similarity index 100% rename from chapters/algorithms/bubble_sort/code/javascript/bubble.js rename to contents/bubble_sort/code/javascript/bubble.js diff --git a/chapters/algorithms/bubble_sort/code/julia/bubble.jl b/contents/bubble_sort/code/julia/bubble.jl similarity index 100% rename from chapters/algorithms/bubble_sort/code/julia/bubble.jl rename to contents/bubble_sort/code/julia/bubble.jl diff --git a/chapters/algorithms/bubble_sort/code/matlab/bubblesort.m b/contents/bubble_sort/code/matlab/bubblesort.m similarity index 100% rename from chapters/algorithms/bubble_sort/code/matlab/bubblesort.m rename to contents/bubble_sort/code/matlab/bubblesort.m diff --git a/chapters/algorithms/bubble_sort/code/python/bubblesort.py b/contents/bubble_sort/code/python/bubblesort.py similarity index 100% rename from chapters/algorithms/bubble_sort/code/python/bubblesort.py rename to contents/bubble_sort/code/python/bubblesort.py diff --git a/chapters/algorithms/bubble_sort/code/racket/bubbleSort.rkt b/contents/bubble_sort/code/racket/bubbleSort.rkt similarity index 100% rename from chapters/algorithms/bubble_sort/code/racket/bubbleSort.rkt rename to contents/bubble_sort/code/racket/bubbleSort.rkt diff --git a/chapters/algorithms/bubble_sort/code/rust/bubble_sort.rs b/contents/bubble_sort/code/rust/bubble_sort.rs similarity index 100% rename from chapters/algorithms/bubble_sort/code/rust/bubble_sort.rs rename to contents/bubble_sort/code/rust/bubble_sort.rs diff --git a/chapters/algorithms/bubble_sort/code/swift/bubblesort.swift b/contents/bubble_sort/code/swift/bubblesort.swift similarity index 100% rename from chapters/algorithms/bubble_sort/code/swift/bubblesort.swift rename to contents/bubble_sort/code/swift/bubblesort.swift diff --git a/chapters/algorithms/bubble_sort/code/ti83basic/BUBLSORT.txt b/contents/bubble_sort/code/ti83basic/BUBLSORT.txt similarity index 100% rename from chapters/algorithms/bubble_sort/code/ti83basic/BUBLSORT.txt rename to contents/bubble_sort/code/ti83basic/BUBLSORT.txt diff --git a/chapters/algorithms/chans_algorithm/chans_algorithm.md b/contents/chans_algorithm/chans_algorithm.md similarity index 100% rename from chapters/algorithms/chans_algorithm/chans_algorithm.md rename to contents/chans_algorithm/chans_algorithm.md diff --git a/chapters/languages/choosing_a_language.md b/contents/choosing_a_language/choosing_a_language.md similarity index 99% rename from chapters/languages/choosing_a_language.md rename to contents/choosing_a_language/choosing_a_language.md index 1a90b0768..b8ff718e4 100644 --- a/chapters/languages/choosing_a_language.md +++ b/contents/choosing_a_language/choosing_a_language.md @@ -1,4 +1,4 @@ -## Choosing a Language +# Choosing a Language I'm not going to beat around the bush here. Every single time I try something new, I fail at it. diff --git a/chapters/languages/compiled/compiled.md b/contents/compiled_languages/compiled_languages.md similarity index 98% rename from chapters/languages/compiled/compiled.md rename to contents/compiled_languages/compiled_languages.md index 83a759e64..883443dea 100644 --- a/chapters/languages/compiled/compiled.md +++ b/contents/compiled_languages/compiled_languages.md @@ -1,4 +1,4 @@ -## Compiled Languages +# Compiled Languages Programming is hard because we need to write instructions for our computer. The computer then reads this set of instructions and executes them accordingly. diff --git a/chapters/general/computational_geometry/computational_geometry.md b/contents/computational_geometry/computational_geometry.md similarity index 100% rename from chapters/general/computational_geometry/computational_geometry.md rename to contents/computational_geometry/computational_geometry.md diff --git a/chapters/algorithms/convolutions/code/c++/convolutions.cpp b/contents/convolutions/code/c++/convolutions.cpp similarity index 100% rename from chapters/algorithms/convolutions/code/c++/convolutions.cpp rename to contents/convolutions/code/c++/convolutions.cpp diff --git a/chapters/algorithms/convolutions/code/c/convolutions.c b/contents/convolutions/code/c/convolutions.c similarity index 100% rename from chapters/algorithms/convolutions/code/c/convolutions.c rename to contents/convolutions/code/c/convolutions.c diff --git a/chapters/algorithms/convolutions/code/c/fft.h b/contents/convolutions/code/c/fft.h similarity index 100% rename from chapters/algorithms/convolutions/code/c/fft.h rename to contents/convolutions/code/c/fft.h diff --git a/chapters/algorithms/convolutions/code/haskell/convolution.hs b/contents/convolutions/code/haskell/convolution.hs similarity index 100% rename from chapters/algorithms/convolutions/code/haskell/convolution.hs rename to contents/convolutions/code/haskell/convolution.hs diff --git a/chapters/algorithms/convolutions/code/julia/conv.jl b/contents/convolutions/code/julia/conv.jl similarity index 100% rename from chapters/algorithms/convolutions/code/julia/conv.jl rename to contents/convolutions/code/julia/conv.jl diff --git a/chapters/algorithms/convolutions/convolutions.md b/contents/convolutions/convolutions.md similarity index 100% rename from chapters/algorithms/convolutions/convolutions.md rename to contents/convolutions/convolutions.md diff --git a/chapters/algorithms/cooley_tukey/code/c++/fft.cpp b/contents/cooley_tukey/code/c++/fft.cpp similarity index 100% rename from chapters/algorithms/cooley_tukey/code/c++/fft.cpp rename to contents/cooley_tukey/code/c++/fft.cpp diff --git a/chapters/algorithms/cooley_tukey/code/c/fft.c b/contents/cooley_tukey/code/c/fft.c similarity index 100% rename from chapters/algorithms/cooley_tukey/code/c/fft.c rename to contents/cooley_tukey/code/c/fft.c diff --git a/chapters/algorithms/cooley_tukey/code/haskell/fft.hs b/contents/cooley_tukey/code/haskell/fft.hs similarity index 100% rename from chapters/algorithms/cooley_tukey/code/haskell/fft.hs rename to contents/cooley_tukey/code/haskell/fft.hs diff --git a/chapters/algorithms/cooley_tukey/code/julia/fft.jl b/contents/cooley_tukey/code/julia/fft.jl similarity index 100% rename from chapters/algorithms/cooley_tukey/code/julia/fft.jl rename to contents/cooley_tukey/code/julia/fft.jl diff --git a/chapters/algorithms/cooley_tukey/code/python/fft.py b/contents/cooley_tukey/code/python/fft.py similarity index 100% rename from chapters/algorithms/cooley_tukey/code/python/fft.py rename to contents/cooley_tukey/code/python/fft.py diff --git a/chapters/algorithms/cooley_tukey/cooley_tukey.md b/contents/cooley_tukey/cooley_tukey.md similarity index 100% rename from chapters/algorithms/cooley_tukey/cooley_tukey.md rename to contents/cooley_tukey/cooley_tukey.md diff --git a/chapters/algorithms/cooley_tukey/res/FT_example.png b/contents/cooley_tukey/res/FT_example.png similarity index 100% rename from chapters/algorithms/cooley_tukey/res/FT_example.png rename to contents/cooley_tukey/res/FT_example.png diff --git a/chapters/algorithms/cooley_tukey/res/butterfly_diagram.png b/contents/cooley_tukey/res/butterfly_diagram.png similarity index 100% rename from chapters/algorithms/cooley_tukey/res/butterfly_diagram.png rename to contents/cooley_tukey/res/butterfly_diagram.png diff --git a/chapters/algorithms/cooley_tukey/res/fft.png b/contents/cooley_tukey/res/fft.png similarity index 100% rename from chapters/algorithms/cooley_tukey/res/fft.png rename to contents/cooley_tukey/res/fft.png diff --git a/chapters/algorithms/cooley_tukey/res/out.dat b/contents/cooley_tukey/res/out.dat similarity index 100% rename from chapters/algorithms/cooley_tukey/res/out.dat rename to contents/cooley_tukey/res/out.dat diff --git a/chapters/algorithms/cooley_tukey/res/radix-2screen.jpg b/contents/cooley_tukey/res/radix-2screen.jpg similarity index 100% rename from chapters/algorithms/cooley_tukey/res/radix-2screen.jpg rename to contents/cooley_tukey/res/radix-2screen.jpg diff --git a/chapters/algorithms/cooley_tukey/res/radix-2screen_positive.jpg b/contents/cooley_tukey/res/radix-2screen_positive.jpg similarity index 100% rename from chapters/algorithms/cooley_tukey/res/radix-2screen_positive.jpg rename to contents/cooley_tukey/res/radix-2screen_positive.jpg diff --git a/chapters/algorithms/cooley_tukey/res/radix-8screen.jpg b/contents/cooley_tukey/res/radix-8screen.jpg similarity index 100% rename from chapters/algorithms/cooley_tukey/res/radix-8screen.jpg rename to contents/cooley_tukey/res/radix-8screen.jpg diff --git a/chapters/algorithms/cooley_tukey/res/sinusoid.png b/contents/cooley_tukey/res/sinusoid.png similarity index 100% rename from chapters/algorithms/cooley_tukey/res/sinusoid.png rename to contents/cooley_tukey/res/sinusoid.png diff --git a/chapters/general/data_compression/data_compression.md b/contents/data_compression/data_compression.md similarity index 96% rename from chapters/general/data_compression/data_compression.md rename to contents/data_compression/data_compression.md index b666fa21a..709d43748 100644 --- a/chapters/general/data_compression/data_compression.md +++ b/contents/data_compression/data_compression.md @@ -6,7 +6,7 @@ It would naively seem that better hardware means that there are less restriction That said, there will always be new devices on the market that require minimizing data storage. In fact, some of the most revolutionary algorithms and methods in existence today fall in the category of data compression. -From lossless data compression with [Huffman encoding](../../algorithms/huffman_encoding/huffman_encoding.md) to genetic compression algorithms and machine learning, there is a lot to learn about this field, and we'll go through it piece-by-piece. +From lossless data compression with [Huffman encoding](../huffman_encoding/huffman_encoding.md) to genetic compression algorithms and machine learning, there is a lot to learn about this field, and we'll go through it piece-by-piece. All that said, no discussion about data compression is complete without first discussing the information, itself -- specifically how information is represented in computer systems. Now, we've discussed this in some depth before with [bitlogic](../../principles_of_code/building_blocks/bitlogic.md), but there is much more to the story than what we let on before. @@ -119,7 +119,7 @@ L_2 &= 0.1\times 3 + 0.2 \times 3 + 0.3 \times 2 + 0.4 \times 1 = 1.9 $$ Here, it's clear that $$L_2 < L_1$$, and thus the second set of codewords compresses our data more than the first. -This measure can be used as a direct test of certain simple data compression techniques, notably those created by Shannon, Fano, and [Huffman](../../algorithms/huffman_encoding/huffman_encoding.md), which will be covered soon! +This measure can be used as a direct test of certain simple data compression techniques, notably those created by Shannon, Fano, and [Huffman](../huffman_encoding/huffman_encoding.md), which will be covered soon!