IS 4

IS 4

1. Linear search

   • advantages
     • very simple algorithm
     • can search ordered and unordered lists.
     • good for small lists
   • disadvantages
     • not good for large lists
     • insufficient compared to binary
   • example
     • One of the most straightforward and elementary searches is the sequential search, also known as a linear search. As a real world example, pickup the nearest phonebook and open it to the first page of names. We're looking to find the first "Smith". Look at the first name.

2. binary search

   • advantages
     • more efficient compared to linear search
     • good for large lists
   • disadvantages
     • must be stored first before searching
     • more complex compared to linear search
   • example
     • You have an array of 10 digits, and the element 59 needs to be found. All the elements are marked with the index from 0 – 9. Now, the middle of the array is calculated. To do so, you take the left and rightmost values of the index and divide them by 2

3. Bubble sort

   • advantages
     • a very simple algorithm to describe to a computer
   • disadvantages
     • it takes a very long time to run
   • example
     • A real-world example of a bubble sort algorithm is how the contact list on your phone is sorted in alphabetical order