Revision

Revision

1. Abstraction

   • Removing the unnecessary features of something
   • focussing on the features you need

2. Decomposition

   • Breaking down a complex instruction into easier sections

3. Searching

   • Binary search
     • Find the middle number in the array
       • If the number is higher than the one you're looking for, ignore the numbers to the right of it.
       • If the number is lower, ignore the numbers to the left of it
       • Best case scenario: The middle number of the array that the program checks first
       • Worst case scenario: The first number of the sequence
       • Prerequisites: The array must be in order.
   • Linear search
     • Look at the first number in the array and compare them
       • If it's right, the program stops
       • If it's the wrong number, move onto the next one

4. Sorting

   • Merge sort

5. Pseudocode