AS Algorithms

Question 1

How does a linear search work?

Answer 1

Checks each item one by one to see if it is the required item

Question 2

Advantages and disadvantages of a linear search?

Answer 2

• data set doesn’t need to be ordered
• can be efficient for small data sets
• inefficient for large data sets

Question 3

When should a linear search be used?

Answer 3

Small, unordered data sets

Question 4

How does a binary search work?

Answer 4

Starts at the middle of the list, then repeatedly divides it in half, leaving the half with the required item in

Question 5

What are the advantages and disadvantages of a binary search?

Answer 5

• efficient for large data sets
• requires the data set to be sorted first, alphabetically or numerically

Question 6

When should a binary search be used?

Answer 6

In large, ordered data sets

Question 7

How does a bubble sort work?

Answer 7

Examines the first two items, swaps them if they are out of order then examines the next two

Question 8

Advantages and disadvantages of a bubble sort?

Answer 8

• very easy to implement
• most inefficient piece of shit ever

Question 9

When should a bubble sort be used?

Answer 9

Small data sets where a small, easy to programme algorithm is required

Question 10

How does an insertion sort work?

Answer 10

Inserts each item into its correct position in the data set one at a time

Question 11

Advantages and disadvantages of an insertion sort?

Answer 11

• more efficient than a bubble sort on small data sets
• inefficient on large data sets

Question 12

Where should an insertion sort be used?

Answer 12

Small, ready sorted lists