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

2025-01-22 10:20:35

Browse Source
This commit is contained in:
Isaac Shoebottom 2025-01-22 10:20:35 -04:00
parent ae285129c8
commit 2eb98aa15b
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -9,4 +9,5 @@ Merge Sort C in ascending order. A greedy solution works in this case.
We can simply run through the sorted list and serve them in order. We can simply run through the sorted list and serve them in order.
But if we assume the greedy algorithm is not optimal in this case But if we assume the greedy algorithm is not optimal in this case
Try to reduce total time T