Question

Write an algorithm to search for given ITEM in a given array X[n] using linear search technique. If the ITEM is found, move it at the top of the array. If the ITEM is not found, insert it at the end of the array. 

Answer 1

Students I gave you solution of 2 part of the question First part Linear Search Technique Algorithm

1. LB=0

2. Repeat steps 3 and 4 until LB>UB //UB means Upper Bound(length of array)

3. If ARR[LB]==ITEM then

{

pos=LB break 

}

4. LB=LB+1

5. if LB>UB then

print "Value Not Found"

else

{ 

//Second part swapping of searched item at top of the array

temp=ARR[pos]

ARR[pos]=ARR[0] 

ARR[0]=temp

}