2.1 Algorithmsss

2.1 Algorithmsss

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
   • 4 Key Areas:
     • Decomposition
       • Breaking down a complex problem or system into smaller, more manageable parts
     • Abstraction
       • Gets rid of the irrelevant stuff in the program
       • Allows to only focus on the important information
     • Pattern Recognition
       • Looking for similarities among and within problems
     • Algorithms
       • Developing a step-by-step solution to solve the problem
       • Algorithms must be detailed & easy to understand so it can be passed onto someone else and have them code it

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