2025-01-10 14:17:23

.obsidian/plugins/various-complements/histories.json

@@ -1 +1 @@
-{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":2,"lastUpdated":1736528276442}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}}}
+{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":2,"lastUpdated":1736528276442}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}}}

.obsidian/workspace.json

@@ -13,7 +13,7 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "UNB/Year 5/Semester 2/CS4725/Lecture Notes.md",
+                "file": "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
                 "mode": "source",
                 "source": false
               },
@@ -167,8 +167,8 @@
   },
   "active": "a4868a0d0ec2cb3a",
   "lastOpenFiles": [
-    "UNB/Year 5/Semester 2/CS4745/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4725/Lecture Notes.md",
+    "UNB/Year 5/Semester 2/CS4745/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4725",
     "UNB/Year 5/Semester 2/CS4613/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4613",

UNB/Year 5/Semester 2/CS3383/Lecture Notes.md

@@ -8,3 +8,13 @@ Need to think about how complex an algorithm is in implementation, the simpler t
 Algorithm which uses array to store previous fib numbers vs one which uses constant number of variables to compute the sequence. Space complexity varies between the two between one being O(n) and one is O(1).
 
 The naive recursive solution for this problem is very bad. By using multiple return values we can make the recursive algorithm equal to the non-recursive algorithm.
+### Counting Primitive Operations
+The algorithm described is a simple implementation to find the max value of an array containing only numbers
+
+By inspecting the pseudo-code, we can determine the maximum number of primitive operations executed by an algorithm, as a function of the input size.
+
+Looking at the number of times n is used, in the worst case scenario, we can see a for loop, as well as other stuff? ending up with a number of operations of 8n-2, with a big O of O(n)
+
+### Relatives of Big O,
+- Big Omega
+- Big Theta - If this is n squared, it means big omega and big o are also n squared.