Algorithms

Algorithms

1. Abstraction

   • Removing unnecessary detail so the main process can be focused on.

2. Decomposition

   • Breaking the program down into smaller parts so the program is easier to solve.

3. Algorithm Thinking

   • Using logical steps to find the solution to a complex problem.

4. State 2 advantages of a bubble sort.

   • Simple Algorithm. Good for short list.

5. State 2 disadvantages of a bubble sort.

   • Not good for large list. Very inefficient way to sort a list

6. State 2 advantages of merge sort.

   • Good for large lists. More efficient than Bubble sort.

7. State 2 disadvantages of using Merge.

   • It can be slower for sorter lists. Uses more memory than other algorithms.

8. State 2 advantages of a n insertion sort.

   • Quick to add items to an ordered list. Quick way of checking if the list is already sorted.

9. State 2 disadvantages of an insertion sort

   • Not good for large lists. More complex compared to Bubble sort.

10. State 4 main programming constructions.

    • Sequence, Count controlled iteration, condition controlled iteration and selection.

11. Difference between Binary and Linear search.

    • Binary search can only search ordered lists, whereas Linear search can search both ordered and unordered lists.

12. State 2 advantages of Linear search

    • Can search ordered and unordered lists. Good for small lists

13. State 2 disadvantages of Linear search.

    • Not good for large lists. Inefficient compared to binary search.

14. State 2 advantages of Binary search.

    • Good for large lists. More efficient to linear equations

15. State 2 disadvantages of Binary search.

    • List must be sorted first before searching. More complex algorithm compared to linear search.