Compare commits

..

2 Commits

Author SHA1 Message Date
46478ef0ef 2025-01-08 14:20:02 2025-01-08 14:20:02 -04:00
ac3276e88f 2025-01-08 13:50:24 2025-01-08 13:50:24 -04:00
3 changed files with 21 additions and 5 deletions

View File

@ -1 +1 @@
{"studied":{"studied":{"currentFile":{"count":1,"lastUpdated":1732902129152}}},"History":{"History":{"currentFile":{"count":1,"lastUpdated":1733161472463}}},"historical":{"historical":{"currentFile":{"count":1,"lastUpdated":1733161505181}}},"events":{"events":{"currentFile":{"count":1,"lastUpdated":1733161507343}}},"intervention":{"intervention":{"currentFile":{"count":1,"lastUpdated":1733161512207}}},"invention":{"invention":{"currentFile":{"count":1,"lastUpdated":1733161517029}}},"gradual":{"gradual":{"currentFile":{"count":1,"lastUpdated":1733161523429}}},"divide":{"divide":{"currentFile":{"count":1,"lastUpdated":1733161561862}}},"historians":{"historians":{"currentFile":{"count":1,"lastUpdated":1733162394642}}},"European":{"European":{"currentFile":{"count":1,"lastUpdated":1733162425591}}},"thought":{"thought":{"currentFile":{"count":1,"lastUpdated":1733162447174}}},"Agree":{"Agree":{"currentFile":{"count":1,"lastUpdated":1733162452692}}},"Renaissance":{"Renaissance":{"currentFile":{"count":2,"lastUpdated":1733334673165}}},"chronology":{"chronology":{"currentFile":{"count":1,"lastUpdated":1733162474220}}},"Pre-modern":{"Pre-modern":{"currentFile":{"count":1,"lastUpdated":1733162481516}}},"history":{"history":{"currentFile":{"count":2,"lastUpdated":1733334453837}}},"constructed":{"constructed":{"currentFile":{"count":1,"lastUpdated":1733162542410}}},"party":{"party":{"currentFile":{"count":3,"lastUpdated":1733327828516}}},"Friday":{"Friday":{"currentFile":{"count":1,"lastUpdated":1733328142948}}},"final":{"final":{"currentFile":{"count":1,"lastUpdated":1733328254232}}},"Exam Stuff":{"Exam Stuff":{"internalLink":{"count":1,"lastUpdated":1733334237677}}},"Points":{"Points":{"currentFile":{"count":2,"lastUpdated":1733334365299}}},"sections":{"sections":{"currentFile":{"count":2,"lastUpdated":1733335567864}}},"Question":{"Question":{"currentFile":{"count":1,"lastUpdated":1733334351043}}},"Questions":{"Questions":{"currentFile":{"count":2,"lastUpdated":1733336070309}}},"essays":{"essays":{"currentFile":{"count":1,"lastUpdated":1733334658406}}},"module":{"module":{"currentFile":{"count":1,"lastUpdated":1733334733227}}},"following":{"following":{"currentFile":{"count":2,"lastUpdated":1733334837779}}},"slides":{"slides":{"currentFile":{"count":1,"lastUpdated":1733334870532}}},"about":{"about":{"currentFile":{"count":1,"lastUpdated":1733334924510}}},"Leaders":{"Leaders":{"currentFile":{"count":1,"lastUpdated":1733334953245}}},"predetermined":{"predetermined":{"currentFile":{"count":1,"lastUpdated":1733335169087}}},"analysis":{"analysis":{"currentFile":{"count":2,"lastUpdated":1733335210664}}},"readings":{"readings":{"currentFile":{"count":1,"lastUpdated":1733335322786}}},"topics":{"topics":{"currentFile":{"count":1,"lastUpdated":1733335343548}}},"submittting":{"submittting":{"currentFile":{"count":1,"lastUpdated":1733335588409}}},"generalization":{"generalization":{"currentFile":{"count":1,"lastUpdated":1733336078936}}},"example":{"example":{"currentFile":{"count":1,"lastUpdated":1733336081284}}}}
{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}}}

View File

@ -11,10 +11,14 @@
"id": "a4868a0d0ec2cb3a",
"type": "leaf",
"state": {
"type": "empty",
"state": {},
"type": "markdown",
"state": {
"file": "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
"mode": "source",
"source": false
},
"icon": "lucide-file",
"title": "New tab"
"title": "Lecture Notes"
}
}
]
@ -161,8 +165,10 @@
"obsidian-git:Open Git source control": false
}
},
"active": "46a6eee907728856",
"active": "a4868a0d0ec2cb3a",
"lastOpenFiles": [
"UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
"UNB/Year 5/Semester 2/CS3383",
"UNB/Year 5/Semester 2",
"UNB/Year 5/Semester 1/CS3113/Exam Review.md",
"UNB/Year 5/Semester 1/HIST1001/Exam Stuff.md",

View File

@ -0,0 +1,10 @@
### Running Time
Most Algorithms transform input objects into output objects. The running time typically grows with the input size. Average case time is often difficult to determine. We focus on the worst case running time, as it's easier to analyze and its crucial to applications such as games, finance, and robotics.
### Space Complexity
In algorithms, you need to think about the amount of space, memory, that you need to compute the algorithm.
### Algorithm Structure?
Need to think about how complex an algorithm is in implementation, the simpler the better. Code organization is also important in the structure.
### Fibonacci
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.