Searching Algorithms

Searching Algorithms

1. Linear Search

   • A 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:
     • disadvantages
       • would take a long time to search a large data structure
     • advantages
       • the only option for searching unsorted data

2. Binary Search

   • A linear search becomes more time-consuming as the data structure becomes larger.
     • Advantages
       • Far faster and more efficient than a linear search
     • Disadvantages
       • Requires data to be sorted; if data is not sorted, a binary search would not work

Bilder und Dateien der Mindmap