Search and Sorting

Search and Sorting

1. Merge sort

   • a sorting algorithm that follows the divide-and-conquer approach.

2. Linear

   • Each item in a list is checked in order from the start of the list until the item is found A linear search allows us to search for values even if the value are not in order
   • a simple sorting algorithm that works by comparing each element of the array to the next element and swapping them if they are out of order

3. Binary

   • The numbers are going to have to be put into order Once in order it wall count how many there is and half it and go to that card Once found half way if the number is lower or higher it will remove the other side It will do this till the number is found
   • Has to be Sored

4. Bubble sort

   • a basic algorithm for arranging a string of numbers or other elements in the correct order. The method works by examining each set of adjacent elements in the string, from left to right, switching their positions if they are out of order.

5. Insertion Sort

   • a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards.