Algorithms

Algorithms

1. Abstraction

   • Removes the unnecessary information but keeps the necessary information. Reduces the complexity and allows an efficient design.

2. Decomposition

   • Breaking down a complex problem to make it easier to understand

3. Binary Search

   • Search a sorted array by repeatedly dividing the search interval in half.

4. Linear Search

   • Finding an item within a list. Checks each item of the list in order until a match is found or the whole list has been searched.

5. Merge Sort

   • Divide and Conquer algorithm.

6. Bubble Sort

   • The simplest sorting algorithm that works by repeatedly swapping the items next to each otherif they are in wrong order.

7. Insertion Sort

   • Builds the final sorted array (or list) one item at a time.