we'll be working with the following set of nine numbers for binary searches set below: 4, 10, 15, 18, 23, 26, 30, 34, 40 Our objective is to pinpoint the number 26 within this array. The initial segment will comprehensively explain how to conduct a linear search to locate the number 26 within this array.
we'll be working with the following set of nine numbers for binary searches set below:
4, 10, 15, 18, 23, 26, 30, 34, 40
Our objective is to pinpoint the number 26 within this array.
The initial segment will comprehensively explain how to conduct a linear search to locate the number 26 within this array.
Given set of nine numbers: [4, 10, 15, 18, 23, 26, 30, 34, 40]
To conduct a linear search to locate the number 26 within the array [4, 10, 15, 18, 23, 26, 30, 34, 40], we would start at the beginning of the array and compare each element to 26. If we find a match, we return the index of that element. If we reach the end of the array without finding a match, we return -1 to indicate that the number is not in the array.
Pseudocode of a linear search:
def linear_search(array, target):
for i in range(len(array)):
if array[i] == target:
return i
return -1
Step by step
Solved in 3 steps
