What is the difference between a linear search and a binary search algorithm?
Share
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Please Disable the AdBlocker to Continue to the site.
A linear search algorithm sequentially checks each element in a list or array until it finds the target element or reaches the end of the list. In contrast, a binary search algorithm repeatedly divides the list in half and eliminates one-half based on whether the target element is greater or less than the midpoint of the list.