MiniMax Sum's time complexity is O(n) because it's doing a constant operation (accessing item in array) n many times (with the for loops) MiniMax Sum's space complexity is 128 bits for the 2 longs being used.
-
Notifications
You must be signed in to change notification settings - Fork 0
TenzinSommer/CSCI-160-Quiz-3
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published