2.1 Algorithms part 2

Question 1

What are the advantage and disadvantage of using binary search?

Answer 1

Advantage:

• Very efficient
• Fast for large lists

Disadvantages:

• only works on ordered lists
• May not be effective with small lists

Question 2

What are the advantages and disadvantages of linear search?

Answer 2

Advantage:

• Simple
• works well with small lists
• Works on unordered lists

Disadvantages:

• Slow with long lists
• Gets quite inefficient6

Question 3

What are the advantages and disadvantages of bubble sort?

Answer 3

Advantage:
- simple
- efficient to check if a list is already ordered 
- uses little memory
Disadvantages:
- inefficient
- Doesn't work well with large lists

Question 4

What are the advantages and disadvantages of merge sort?

Answer 4

Advantages:

• efficient
• Quicker than bubble
• Consistent run time, no matter list length

Disadvantages:

• Slow for small lists
• Goes through huge process even if already sorted
• lots of memory

Question 5

What are the advantages and disadvantages of insertion sort?

Answer 5

Advantage:

• easily coded
• works well with small lists
• doesn’t need much memory
• Quick at checking list is already sorted

Disadvantage:
- Doesn’t work well with large lists