You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: OMSCS/Courses/GA/Practice Problems/6.2 - Hotel Stops.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -78,7 +78,7 @@ So for each hotel $A_i$, you need to calculate the penalty of stopping at that h
78
78
- Is there a risk with using a greedy algorithm? You want to travel exactly 200 miles in a day. Sometimes it might be worth stopping early for a larger penalty to avoid a bigger penalty later. Does the math check out? The penalty is the distance squared.
79
79
- Making the algorithm $n^2$ seems to account for possible greediness.
0 commit comments