2.3.1 Algorithms - Aaron

Question 1

What is binary search?

Answer 1

A O (log(n)) algorithm to search a sorted list for a particular item by repeatedly halving a sublist which could contain the item.

Question 2

What is the big O for constant complexity?

Answer 2

O (1)

Question 3

How is time complexity measured?

Answer 3

Big O notation

Question 4

What does exponential time complexity mean?

Answer 4

The amount of time to complete an algorithm is proportional to 2 to the power of number of items inputted.

Question 5

What does logarithmic time complexity mean?

Answer 5

The time taken to complete an algorithm will increase at a smaller rate as the number of elements inputted.

Question 6

What is an algorithm?

Answer 6

An algorithm is a series of steps that complete a task.

Question 7

What is the big O of a linear search algorithm?

Answer 7

O (n)

Question 8

What is the big O of a binary search algorithm?

Answer 8

O(log(n))

Question 9

What is the big O of a bubble sort algorithm?

Answer 9

O (n2)

Question 10

What is a logarithm?

Answer 10

How many times a certain number is multiplied together to reach another number.