Linear Search:A search method that checks each element in a collection one by one until the desired item is found.
Binary Search:A more efficient search method that divides the collection into halves and compares the target item with the middle element to determine if it should continue searching on the left or right half.
Hashing: Another type of search method that uses a hash function to map keys to specific locations, allowing for fast retrieval of data.