Big O Searching Algorithm Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Linear Search Big O time complexity

A
BEST CASE - O(1)
AVERAGE CASE -
O(n)
WORST CASE-
O(n)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Binary Search Array

A

BEST CASE - O(1)
AVERAGE CASE- O(log n)
WORST CASE-
O(log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Binary Search Tree

A

BEST CASE - O(1)
AVERAGE CASE-O(log n)
WORST CASE- O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Binary Search array

A

BEST CASE- O(n)
AVERAGE CASE-O(log n)
WORST CASE-
O(log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Name and notation

A
O(1) = Constant
O(log n) = Logarithmic
O(n) = Linear
O(n log N) = Linearithmic
O(n^2) = Polynomial
O(2^n) = Exponential
O(n!) = Factorial
How well did you know this?
1
Not at all
2
3
4
5
Perfectly