ALGORITHIMS 2.1 v2

ALGORITHIMS 2.1 v2

1. Computational Thinking

   • Allows us to take a complex problem, understand what the problem is, and then develop possible solutions
   • The use of a computer to solve problems

2. Binary Search

   • List must be in order
   • Middle Value is taken
     • Search is stopped if it is the value is the one you're looking for
     • If middle value is larger than the desired one: Take the values to the left of the middle value
       • Then repeat with the new list
     • If middle value is smaller than the desired one: Take the values to the right of the middle value

3. LInear Search

   • List does not have to be in order
   • First value of list is checked
     • Search is stopped if it is the value is the one you're looking for
     • If not desired value: Check next value on the list
       • Process is repeated until desired value is attained

4. Bubble Sort

   • A method for sorting out unordered lists
   • Take the first and second elements from the list and compare them
     • If element 1 > element 2: Swap
       • Else: Leave it

5. Merge Sort

   • A list is split into individual lists, these are then combined (2 lists at a time)
   • Split all elements into individual lists
     • Compare the first element into first two lists

6. Flow Chart

   • Can be used to represent an algorithm
   • It shows the data that is inputted and outputted
     • It shows the processes (actions) that take place
       • It shows the decisions and repetitions that take place