Big O

Ace your homework & exams now with Quizwiz!

Big O Notation

Big O notation tells you how fast an algorithm is. It does not tell you the speed in seconds, rather Big O notation lets you compare the number of operations and tells you how fast the algorithm grows. a notation that expresses computing time (complexity) as the term in a function that increases most rapidly relative to the size of a problem

What does Big O notation look like?

O(n) where n is the number of operations

What does Big O count?

The number of operations.

null

null


Related study sets

ACCT 201B - Chapter 7 Video Book

View Set

Chapter 13 - Introduction to Mortgage Finance

View Set