From 2eb98aa15bf7c1b64ceb2c68f4c3fae2182b02aa Mon Sep 17 00:00:00 2001 From: Isaac Shoebottom Date: Wed, 22 Jan 2025 10:20:35 -0400 Subject: [PATCH] 2025-01-22 10:20:35 --- UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md b/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md index d689040..92d7840 100644 --- a/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md +++ b/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md @@ -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. -But if we assume the greedy algorithm is not optimal in this case \ No newline at end of file +But if we assume the greedy algorithm is not optimal in this case +Try to reduce total time T \ No newline at end of file