2.1 algorithms

2.1 algorithms

1. abstaction

   • Abstraction in its main sense is a conceptual process where general rules and concepts.
   • are derived from the usage and classification of specific intructions
   • a concept that acts as a super-categorical noun for all subordinate concepts
   • may be formed by filtering the information

2. decompostion

   • breaking down a large problem into smaller bits to do It more easily
   • the definition on google
     • Decomposition is the process by which organic substances are broken down into a more simple organic matter
       • this applies to a matter of any problem

3. computational thinking

   • the use of computers to solve problems
   • examples
     • calculator
     • grammar
     • geography
     • history
   • we use computers for something our brain cannot do as fast as a computer
     • google definition
       • In education, computational thinking is a set of problem-solving methods that involve expressing problems and their solutions in ways that a computer could execute.

4. linear search

   • each item in the list is checked in order
     • the binary search only works if its in order
     • so how can you search it if its not in order
     • check first value

5. binary search

   • an orderd list is divided in 2 to get a comparison
     • takes middle value
     • list needs to be in order
     • compare to the value your looking for