Answer:
The linear search changes from O(1) to O(n), and binary search changes from O(1) to O(log n). Where n is an integer.
Explanation:
The linear algorithm transverse through a list of items until the target value is found. When a search is conducted, the algorithm moves through the unordered list, one item at a time, denoted as O(1). But when the list size is increased, it is gets to the worse case of O(n) with n as the integer of the increased value.
