# Big o

?
• Created by: glennw
• Created on: 07-05-19 10:44
What is BIG O?
A way to find out how good there algorithm is.
1 of 13
How to work out amount of memory used?
Calculate how many inputs there are.
2 of 13
How to work out the performance?
The performance of the algorithm.
3 of 13
What is constant complexity?
The time stays remain the same no matter on the amount of data.
4 of 13
What is logarithmic complexity?
The time increases to complete the process as the amount of data increases.
5 of 13
What is linear complexity?
The time is proportional to the number of data.
6 of 13
What is polynomial complexity?
The time increases to complete the process as the amount of data increases.
7 of 13
What is exponential complexity?
The time increases drastically to complete the process as the amount of data increases.
8 of 13
Give an example of constant complexity:
Finding the first or last information in a list
9 of 13
Give an example of logarithmic complexity:
Binary search
10 of 13
Give an example of linear complexity:
Linear search
11 of 13
Give an example of polynomial complexity:
Bubble sort
12 of 13
Give an example of exponential complexity:
The traveling salesman problem
13 of 13

## Other cards in this set

### Card 2

#### Front

How to work out amount of memory used?

#### Back

Calculate how many inputs there are.

### Card 3

#### Front

How to work out the performance?

### Card 4

#### Front

What is constant complexity?

### Card 5

#### Front

What is logarithmic complexity?