Unit 2.1 -

Unit 2.1 -

1. Computer Thinking

   • Computational Thinking is taking a complex problem, understanding the problem and coming up with possible solutions
   • We then present these solutions in a way that humans or computers can understand
   • Step 1 - Decomposition - Breaking down a complex problem into smaller more managebale parts
   • Step 2 - Abstraction - Ignoring irrelevant details and info
   • Step 3 - Pattern Recognition - Looking for similarities between current and old problems
   • Step 4 - Algorithms - Coming up with solutions to the problem

2. Algorithmic Thought - Identifying steps involved in solving a problem

   • Linear Search - Each item in the list is checked in order - Not Sorted
     • Check the first value
     • IF it is the value you're looking for - celebrate and stop
     • ELSE move on & check the next value
     • Repeat until you have checked all variables
   • Binary Search - An ordered list is divided in 2 with each comparison - Sorted
     • Take the middle value, compare to value your looking for
     • IF it is the value you're looking for - celebrate & stop
     • ELIF it is larger than the one you're looking for, take the values to the left
     • ELIF it is smaller than the value you're looking for, take the values to the right
     • Repeat with the new list

3. Bubble Sort

   • Step 1 - Take first two elements from list
   • Step 2 - Confirm them
   • Step 3 - IF element > Element 2, swap them. ELSE - Do nothing
   • Step 4 - Repeat: Move along the list to the next pair until you have made no changes to the list