2.1.1 to 2.1.7

2.1.1 to 2.1.7

1. 2.1.4

   • Merging lists is to sort data into individual lists
     • Compare > Place smallest in list > Compare
   • Merging sort is a list split into individual lists then merged
     • Split into lists > Merge into Pairs > Merge > Keep merging until in order

2. 2.1.5

   • Order lists (Elements changed)
     • Binary
       • Middle Value < Compare to a value2 continue > If value2 stop > Or if larger substract values to left > Or is smaller substract values to right
   • Compare items in list and put in correct place

3. 2.1.6

   • An algorithm is a series of steps to sole a problem
   • PseudoCode has no rules on how it should be wirrten

4. 2.1.7

   • A trace table is a table that follows the values of variables
   • A dry run is going through lgorithm with basic data

5. 2.1.1

   • Computational thinking
     • The use of a computer to solve problems
     • Uses Abstraction, Decomposition & Algorithmic
       • Abstraction is removing unneeded elements
       • Decomposition is breaking a complex problem into smaller simpler parts
   • Algorithmic thinking is to identify the steps to solve a problem

6. 2.1.2

   • Linear
     • Each item checked in order > First Value > If First Value Stop > Or check next value

7. 2.1.3

   • Bubble sort
     • Take 1st & 2nd > Compare > If 1 > 2 swap > Or do nothing > Repeat
     • If it is in reverse order thats the worst case
     • Going through a list and swapping that are in wrong order repeatedly