2.1 algorithm

2.1 algorithm

1. What is the name of this searching algorithm? Linear (search).

2. Linear search compares each value in turn. Worst case scenario, 100,000 comparisons / all values checked. Binary search splits size of list in half each time / uses divide and conquer. Worst case scenario, many fewer comparisons

   • Terminator / start / stop symbol Used at the very beginning / very end of the program / algorithm.
     • Decision Used to make yes/no decisions/choices
       • when implementing the bubble sort -- Initialised to False at the start of the algorithm. If pairs of numbers are swapped, set to True.

3. What is the data type of the variable swaps? Boolean.

   • Linear (search).
   • decomposition -Used to break down a (complex) problem

4. Decision Used to make yes/no decisions/choices Suitable example (eg IF x > 10)

5. a representation of a concept / object / thing.in this case, the rollercoaster.

6. using a binary search? Values are not in (alphabetical) order.

   • Merge sort.

7. abstraction.