A) odd numbers case:
Sequential or linear search is a searching mechanism where every element one by one is
searched until the result is found.
where l is list and x is our search item.
Minimum number of sequential search comparisons = 1
Maximum number of sequential search comparisons = N
Average number of sequential search comparisons for successful searches = ½ N
To find the middle element we can use (biggest - smallest + 1)/ 2.
2)EVEN number case:.
if the array has even number of elements then divide the list into two subparts of equal size name
array1 array 2, the element which is immediately after array 1 is considered as mid element. so
the complexity even in this case if n/2.
3)
If we find the element in 1st position then comparisons = 1
2nd positions then 2. 3rd postion 3..... nth position = n so the average no of comparisons in linear
search is (1+2+3+4+5+6.....+n) = n(n+1)/2
Solution
A) odd numbers case:
Sequential or linear search is a searching mechanism where every element one by one is
searched until the result is found.
where l is list and x is our search item.
Minimum number of sequential search comparisons = 1
Maximum number of sequential search comparisons = N
Average number of sequential search comparisons for successful searches = ½ N
To find the middle element we can use (biggest - smallest + 1)/ 2.
2)EVEN number case:.
if the array has even number of elements then divide the list into two subparts of equal size name
array1 array 2, the element which is immediately after array 1 is considered as mid element. so
the complexity even in this case if n/2.
3)
If we find the element in 1st position then comparisons = 1
2nd positions then 2. 3rd postion 3..... nth position = n so the average no of comparisons in linear
search is (1+2+3+4+5+6.....+n) = n(n+1)/2.
A) odd numbers caseSequential or linear search is a searching mec.pdf
1. A) odd numbers case:
Sequential or linear search is a searching mechanism where every element one by one is
searched until the result is found.
where l is list and x is our search item.
Minimum number of sequential search comparisons = 1
Maximum number of sequential search comparisons = N
Average number of sequential search comparisons for successful searches = ½ N
To find the middle element we can use (biggest - smallest + 1)/ 2.
2)EVEN number case:.
if the array has even number of elements then divide the list into two subparts of equal size name
array1 array 2, the element which is immediately after array 1 is considered as mid element. so
the complexity even in this case if n/2.
3)
If we find the element in 1st position then comparisons = 1
2nd positions then 2. 3rd postion 3..... nth position = n so the average no of comparisons in linear
search is (1+2+3+4+5+6.....+n) = n(n+1)/2
Solution
A) odd numbers case:
Sequential or linear search is a searching mechanism where every element one by one is
searched until the result is found.
where l is list and x is our search item.
Minimum number of sequential search comparisons = 1
Maximum number of sequential search comparisons = N
Average number of sequential search comparisons for successful searches = ½ N
To find the middle element we can use (biggest - smallest + 1)/ 2.
2)EVEN number case:.
if the array has even number of elements then divide the list into two subparts of equal size name
array1 array 2, the element which is immediately after array 1 is considered as mid element. so
the complexity even in this case if n/2.
3)
If we find the element in 1st position then comparisons = 1
2nd positions then 2. 3rd postion 3..... nth position = n so the average no of comparisons in linear
search is (1+2+3+4+5+6.....+n) = n(n+1)/2
