Binary search vs Linear search

Binary search vs Linear search

1. How work binary search?

   • It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one

2. How work linear search?

   • If first item of unordered list it is item what you find - stop, if not look at the next item on the list. Repeat this until you find item what you looking for

3. When I can use linear search?

   • If you have small list , if you have ordered or unordered list.

4. When I can use binary search?

   • If you have large list , if you have only ordered list.

5. Compare this two types of searc

   • Linear search better it small lists, however binary search better in large lists, because it take less moves than linear, so linear inefficient than binary. Linear better in unordered lists. Whereas binary search MUST have ORDERED list.