Searching Algorithms

Searching Algorithms

1. Binary Search-A binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for.

2. Linear search- A linear search looks down a list, one item at a time, without jumping.

3. Sorting Algorithms

   • Bubble sort- One of the main advantages of a bubble sort is that it is a very simple algorithm to describe to a computer. There is only really one task to perform (compare two values and, if needed, swap them). This makes for a very small and simple computer program.
     • Merge sort- Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.
   • Data Types
     • Different types of data are represented in different ways inside a computer and need varying amounts of memory to store them. They also have different operations that can be performed upon them. All values that belong to the same data type will be represented in the same way.

Images and files in the map