Answers
Requires the list to be sorted before the search begins
Simple to implement and understand
Divides the search interval in half repeatedly
Does not require the list to be sorted
Time complexity is O(log n) where n is the number of elements in the list
More efficient than linear search for large datasets but requires sorting
Best suited for small or unsorted datasets
Best suited for large, sorted datasets
Checks each element in the list sequentially
Time complexity is O(n) where n is the number of elements in the list
