Algorithms

Algorithms

1. Sorting algorithms

   • Bubble sort
     • A simple algorithm which repeatedly passes through a jumbles up list to be sorted, comparing and swapping items that are in the wrong order.
   • Merge Sort
     • Merge sort is an example of a divide and conquer algorithm. It divides an array in half,
   • Insertion Sort
     • A sorting algorithm that takes a number from the list and puts it in it's correct place in the list. It is generally less effective on larger lists.

2. Searching algorithms

   • Linear search
     • A process that checks every item in a list one by one until it finds the target item. It is generally less efficient than a binary search unless the target item is the first item in the list.
       • For both of these search algorithms, the list needs to be in order (either alphabetical or increasing numerical)
   • Binary search
     • A process that compares the target to the middle item and gets rid of half of the list based on whether the target should be higher or lower than the middle item. It keeps repeating until it finds the target item. It is generally more efficient unless the target is the first item in the list.

3. Abstraction

   • Removing unnecessary details and only keeping what is necessary.

4. Decomposition

   • Breaking a complex programme down into smaller parts that are easier to understand and programme.

5. Pseudocode