Searching algorithms

Searching algorithms

1. Linear search

   • starts at one end of a data collection, working its way to the other, examining each data item in the collection, in order
   • Advantages
     • the only option for searching unsorted data.
   • disadvantages
     • would take a long time to search a larg data structure

2. Binary Search

   • a quicker algorithm that only works if data is already sorted.
   • Advantages
     • far faster and more efficient then linear searches.
   • Disadvantages
     • Requires data to be sorted and if not sorted a binary search would not work.

Bilder und Dateien der Mindmap