Algorithms

Algorithms

1. Abstraction

   • Abstraction is a technique that simplifies a problem by removing unnecessary detail so that you can focus on the important parts that are relevant to the problem. E.g.Money / Maps

2. Search Algorithms

   • Binary
     • The middle item is found by splitting the dataset into 2. If the desired item is below this middle item, then the second half is eliminated and the process is repeated on the first half until the desired item is found. (And Vise Versa)
       • Advantages : Faster than a linear search (More efficient)
       • Disadvantages : Dataset must be sorted first
   • Linear
     • Each item is checked in order. Once the item is found it is returned.
       • Advantages : Easy to implement
       • Disadvantages : Slow on a big data set (Not efficient)

3. Decompostion

   • The process of filtering out unnecessary detail from a problem. Breaking a complex problem into smaller, more manageable sub-problems. Each smaller part can then be solved individually, before all the sub-solutions are combined to solve the original problem.

4. Sort Algorithms

   • Bubble
   • Merge
   • Insertion

5. Pseudocode

6. Flow Diagrams