Big O Drills

gistfile1.txt

Even or Odd: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Are you here?: Polynomial time O(n^k) //has nested loops
Doubler: Linear time O(n) //Given input a and input b, where b is twice as large as a, it will take a linear algorithm twice as long to process b compared to a.
Naive Search: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Creating pairs: Polynomial time O(n^k) //has nested loops
Computing fibonaccis: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
correct-----Linear time O(n) //Given input a and input b, where b is twice as large as a, it will take a linear algorithm twice as long to process b compared to a
An Efficient Search: Logarithmic time O(log(n)) //cut the problem size in half each round through
Random element: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Is it prime?: Linear time O(n) //Given input a and input b, where b is twice as large as a, it will take a linear algorithm twice as long to process b compared to a