Unit 2.1

Unit 2.1

1. Decompostion

   • The breaking down of large problems into smaller easier to solve ones
     • Which can be combined to make the full solution.

2. Algorithmic Thinking

   • Understanding the steps included in solving a specific problem

3. Binary Search

   • Put the list in order
     • Take the value in the middle
       • Repeat until you get the value you want

4. Linear Search

   • Check the first value
     • If it is the wanted value then stop
       • Check the next value
         • Repeat until all have been checked.

5. Merging Lists

   • Split all elements into individual lists
     • Compare the first element in both lists.
       • Put the smallest in a new list
         • Put the smallest in a new list
           • Compare the next of one list with the second of the second list

6. Merge Sort

   • Split a list into individual lists, of one element each
     • Merge the lists in pairs putting the smallest first
       • Merge until it is all in order

7. Abstraction

   • Using symbols and variables and other things
     • That represents one of many real problems in a computer program and removing elements that aren't needed
       • And removing elements that aren't needed

8. Sorting

   • Arranging the elements in a list or collection
     • In increasing or decreasing order of a property.