Algorithms

Algorithms

1. Abstraction

   • Removes the unnecessary details
     • Simplifies a problem
   • Maps
     • They leave out details and leave important parts like roads and landmarks
   • Money
     • A representation of

2. Searches

   • Binary search
   • Linear search
   • Searches for items in lists

3. Sorting

   • Bubble sort
     • Start with the first number and compare it with the second number. If the numbers are not in the correct order then swap them over. Now continue to go through each of the numbers comparing and swapping if necessary. When we reach the end of the numbers we have completed the first pass. Repeat this process with new passes until no pair needs to be swapped. This final pass shows that the list has been correctly sorted.
   • Merge sort
   • Insertion sort
     • Start at the left of the list on the second number. Compare the number to the left of it. If it less than the number on the left, then insert the number into the numbers on the left. Otherwise leave it where it is. Repeat the process until you reach the end of the list. The list is now sorted.
   • Puts lists into correct order

4. Pseudocode

   • Uses structured English to give a detailed description of what a program must do and allows programmers to create the program in whatever language they choose.
   • The main purpose of pseudocode is to plan algorithms

5. Algorithm

   • A set of instructions to follow to solve a problem
   • Like make a cup of tea

6. Decomposition

   • Breaks down complex algorithms into problems that can be maintained