Skip to content

TenzinSommer/CSCI-160-Quiz-3

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

CSCI-160-Quiz-3

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.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published