notes

commit 813d6e0f685aa88779e78281e0d16bec6158f091
parent 32ca61a1b52ebb4d80dcda4a9f8df71aa02c3633
Author: Andrew <andrewlaack1@gmail.com>
Date:   Mon, 19 Aug 2024 16:08:08 -0500

Completed notes

Diffstat:
M
Algorithms.md
 | 
2
+-
A
Amortization.md
 | 
8
++++++++
M
AsymptoticNotation.md
 | 
2
++

3 files changed, 11 insertions(+), 1 deletion(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -18,7 +18,7 @@ L1:
 L2:
 	- [[LinkedLists.md]]
 	- [[DataStructureAugmentation.md]]
-	- [[Amortization.md]] - TODO
+	- [[Amortization.md]] 
 
 
 #### Intro To Algorithms Textboo (CLRS)
diff --git a/Amortization.md b/Amortization.md
@@ -0,0 +1,8 @@
+:algorithms: :data-structures:
+# Amortization
+
+L2
+
+## Notes
+
+**Definition:** Amortization is the process of averaging out more complex actions across many events even if the smaller events are not actually doing anything related to the complex action.
diff --git a/AsymptoticNotation.md b/AsymptoticNotation.md
@@ -7,6 +7,8 @@ L1 MIT
 
 **Definition:** Asymptotic notation describes the running time of an algorithm.
 
+#### Types of complexity notation
+
 There are three different notations for this big O, beg Theta, and big Omega. 
 
 1. Big Theta