Comparing Algorithms - Big O
Revision as of 12:00, 15 May 2017 by Ilostmylastaccount (talk | contribs) (Created page with "Big O Notation is a measure of how long or how much memory is needed to execute and algorithm. This uses the worst case scenario, so that you get the maximum time and memory u...")
Big O Notation is a measure of how long or how much memory is needed to execute and algorithm. This uses the worst case scenario, so that you get the maximum time and memory usage. It uses n as the number of items.
