Algorithms and Flowchart linear search

Linear Search

Q) Explain the linear search with an algorithm with an example.

Linear search is the sequential search. it is started with elements, in this search elements are checked sequentially until the required element is found.

When an element is found, the search is said to be successful. But when all elements are compared and the required element is not found then the search is said to be unsuccessful.

Algorithm: linear_search (Data[], N Item, loc)

• This is the algorithm for linear search
• Data[] – Array of elements,
• item – Element to be searched,
• N – the size of an array
• loc – location
• i – index variable

step 1: Start
step 2: Set i = 1
step 3: Set loc = 0
step 4: Repeat steps 5 and 6 until i <= n and loc = 0
step 5: [compare Data[i] and item]
       if data[i] == item the
          set loc=i
          Goto step7
       end if
step 6: set i = i + 1
step 7: if loc == 0 then
         print "item is not found"
      Else
        print "item is found at loc"
step 8: stop

Example Linear Search

Copy Post 😊