IsaacShoebottom/Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2025-01-14 08:38:50

Browse Source
This commit is contained in:
Isaac Shoebottom
2025-01-14 08:38:50 -04:00
parent 6d518246ff
commit 9ed144d7f1
2 changed files with 11 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
UNB/Year 5/Semester 2/CS3383/Lecture Notes.md
View File

@ -17,4 +17,13 @@ Looking at the number of times n is used, in the worst case scenario, we can see
### Relatives of Big O,
- Big Omega
- Big Theta - If this is n squared, it means big omega and big o are also n squared.
- Big Theta - If this is n squared, it means big omega and big o are also n squared.
## GO over slides for Jan 13th as I missed first half
### Greedy Algorithms
Greedy algorithms always optimize for the current best chest, ignoring any possible better outcomes in the future.
This can work in cases where a problem has a greedy property.
### Making Change Problem
In the case where the denominations are always larger/equal to 2 of the smaller denominations then it makes sense when giving change, to simply give the largest coin available.