2.1 Algorithms

2.1 Algorithms

1. Searches

   • Binary
     • The midpoint is found repeatedly until it reaches a point where the chosen term is the only one remaining
     • The data has to be in order for it to work
     • Quicker when the first item in the list isn't the first in the list
   • Linear
     • Goes through every term until it finds the right one
     • Doesn't have to be in order

2. Sorts

   • Merge
     • Splits into separate lists, which are sorted stage by stage and end up in one list.
   • Bubble
     • Runs through the list multiple times sorting the numbers as it goes through
   • Insertion
     • Takes each number and puts it in the right place in the list
     • Only requires one run through the list

3. Words

   • Decomposition
     • Breaking Down a Problem into Simpler Steps
   • Abstration
     • Removing Unnecessary details and adding necessary details to focus on the problem
   • Algorithmic Thinking
     • A way of getting to a solution through the clear definition of the steps needed

4. Flow Charts

Images and files in the map