notes

commit 0a121358380dd061588f4d96af1f7115bfe9df49
parent 9a9ddcd56b33182fc13198c2173772201e273568
Author: Andrew <andrewlaack1@gmail.com>
Date:   Sun, 28 Jul 2024 13:11:37 -0500

Took notes on algos

Diffstat:
A
Algorithms.md
 | 
10
++++++++++
A
LasVegasMethod.md
 | 
8
++++++++
A
MonteCarloMethod.md
 | 
12
++++++++++++
A
PerlinNoise.md
 | 
12
++++++++++++
M
index.md
 | 
1
+

5 files changed, 43 insertions(+), 0 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -0,0 +1,10 @@
+:index: :algorithm:
+# Algorithms Index
+
+This is an index for links to notes taken about algorithms. These are CS related algorithms and not related to machine learning (see [[MachineLearning.md]] for that).
+
+## Links
+
+[[MonteCarloMethod.md]]
+[[LasVegasMethod.md]]
+[[PerlinNoise.md]]
diff --git a/LasVegasMethod.md b/LasVegasMethod.md
@@ -0,0 +1,8 @@
+:algorithm:
+# Las Vegas Method
+
+SS
+
+## Notes
+
+**Definition:** The Las Vegas method is similar to the monte carlo method as it uses random sampling, but it always gives the correct answer whereas the monte carlo method does not guarantee a correct answer. 
diff --git a/MonteCarloMethod.md b/MonteCarloMethod.md
@@ -0,0 +1,12 @@
+:algorithm:
+# Monte Carlo Method
+
+SS
+
+## Notes
+
+**Definition:** The monte carlo method is a class of algorithms that use repeated random sampling to converge upon a solution to a problem where there may be a true solution, but are too complex to analyze.
+
+An example of this is the calculation of PI using random sampling of a 2D grid to find the approximate area of a circle with a radius of 1.
+
+Another example of this could be any arbitrary volume/surface area calculation where we don't know the exact formula for the true calculation.
diff --git a/PerlinNoise.md b/PerlinNoise.md
@@ -0,0 +1,12 @@
+:algorithm:
+# Perlin Noise 
+
+SS
+
+## Notes
+
+**Definition:** Perlin noise is a procedural gradient texture generated using the perlin noise algorithm.
+
+Not 100% about this:
+
+The perlin noise algorithm creates a grid where each point on the grid is represented by a vector. We then take the dot product with the other three surrounding vectors to find the value at a given point. From here we use interpolation to fill in the rest. 
diff --git a/index.md b/index.md
@@ -21,6 +21,7 @@ This is the index for my main note classifications. I will maintain this as a ho
 [[ModelNotes.md]]
 [[LinearAlgebra.md]]
 [[Calculus.md]]
+[[Algorithms.md]]
 
 ## Technology Books to Read