Shared Flashcard Set

Details

Data Structures
BIG O
9
Computer Science
Undergraduate 3
10/16/2009
Click here to study/print these flashcards.

Create your own flash cards! Sign up here.

Additional Computer Science Flashcards

 

 

Cards

Term
for(int i = 0; i < n; i++)...
 Definition
O(n)
Term
for (int i = n; i > 0; i--)...
 Definition
O(n)
Term
for (int i = 0; i * i < n; i++)...
 Definition
O(sqrtn)
Term
for (int i n; i > 0; i = i / 2)...
 Definition
O(logn)
Term

for (int i = 0 ; i< n; i++)

       for(int j = 0; j < n; j++)...

 Definition
O(n^2)
Term

for (int i = 0; i < n; i++)

      for (int j = 0; j < i; j++)

 Definition
O(n^2)
Term

for (int i = 0; i < n; i++)

       for (int j = 0; j <13; j++)

 Definition
O(n)
Term

for (int i = n; i > 0; i=i / 2)

          for (int j = n; j > 0; j = j /2)...

 Definition
O(logn)(logn)
Term

for (int i = 0; i < n; i++)

                for (int j = n; j > 0; j = j /2)...

 Definition
nlog
Supporting users have an ad free experience!