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

2025-01-15 13:41:37

Browse Source
This commit is contained in:
Isaac Shoebottom
2025-01-15 13:41:37 -04:00
parent 239b0c84d7
commit c5a1ddb862
3 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -26,4 +26,5 @@ Greedy algorithms always optimize for the current best chest, ignoring any possi
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.
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.