Algorithms

Algorithms

1. Sorting Algorithms

   • Quick sort
   • Insert sort
     • Insertion sort takes the first number from the list and stores it... then takes the second number and compares it to the number/s already stored... If bigger then will sote=re it to the right and if smaller to the right... It will keep adding numbers unitl thew whole list is stored and therfore sorted.
   • Merge sort
     • Merge sort
   • Bubble sort

2. Searching Algorithms

   • Linear Search
     • Linear search will check each listed item one by one until the wanted item is found.If the item is found it will stop searching but if not in the list linear search it will go through the whole list
       • POSITIVES
         • Easier to code and also uses less memory
       • NEGaTIVES
         • Takes a lot longer for the computer to search.
   • Binary Search
     • Binary search looks at the middle point of the sorted list and determines whether the searched item is worth more or less than/ bigger or smaller than the middle point... If the middle point is worht less then the comoputer will look at the middle point of the new list on the right of the previous middle. It will repeat this process until the searched item is found or until it has searched all possible outcomes and the search item is not there
       • POSITIVES
         • Faster than Linear search .
       • NEGaTIVES
         • Uses more memory and also is harder to code than linear search.

3. An algorithm is a process or set of rules to be followed in calculations or other problem-solving operations