Algorithms

Algorithms

1. Search Algorithms

   • Linear Search
     • A Linear Search works by looking through each item and checks if it matches the user's search, otherwise the item will not be found
       • Advantages
         • Linear search is able to find values within an unsorted list.
         • Disadvantages
           • Linear search has a longer searching process as it checks every value one at a time until it has found the value the user is looking for.
   • Binary Search
     • First you find the midpoint and then you decide whether the value you are looking at is higher or lower than the value you are looking for. And then you repeat this.
     • Advantages
       • Binary search takes less time to find a value requested by the user's search.
       • Disadvantages
         • Binary search can only find values within a a sorted list.

2. Sort algorithms

   • Bubble sort
     • Advantages
       • Simple, quickest and the easiest to code.
     • Disadvantages
       • Takes the longest to sort a list.
   • Insert sort
     • Advantages
       • Twice as fast as the bubble sort. Simple and easy to code.
     • Disadvantages
       • Slower than merge sort.
   • Merge sort
     • Advantages
       • The fastest to execute: faster to sort the list than bubble and insert sort.
     • Disadvantages
       • More difficult to code than bubble and insert sort.

3. Abstraction

   • What is Abstraction?
     • Abstraction is the process of removing unnecessary information from something in order to reduce its complexity, while increasing efficiency.
   • Decomposition
     • What is Decomposition?
       • Decomposition is the breaking down of a sophisticated problem or system into smaller parts which are more manageable and easier to understand.