{"id":548,"date":"2023-03-23T07:35:42","date_gmt":"2023-03-23T07:35:42","guid":{"rendered":"http:\/\/learnlearn.uk\/ibcs\/?page_id=548"},"modified":"2025-04-05T11:00:11","modified_gmt":"2025-04-05T11:00:11","slug":"sequential-linear-search","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/ibcs\/sequential-linear-search\/","title":{"rendered":"Sequential (Linear) Search"},"content":{"rendered":"
\n

Introduction to Linear Search<\/h2>\n
\n\n

Introduction to Linear Search<\/h2>\n

Linear search, also known as sequential search, is a simple searching algorithm that checks each element of a list in order until a match is found or the entire list has been traversed.<\/p>\n

\n

Algorithm Steps<\/h3>\n

 <\/p>\n

\n

    \n
  1. Start at the beginning of the list.<\/li>\n<\/ol>\n
      \n
    1. Compare the target value with the current element.<\/li>\n<\/ol>\n
        \n
      1. If the target value matches the current element, the search is successful and the position of the element is returned.<\/li>\n<\/ol>\n
          \n
        1. If the target value does not match the current element, move to the next element in the list.<\/li>\n<\/ol>\n
            \n
          1. Repeat steps 2-4 until a match is found or the end of the list is reached.<\/li>\n<\/ol>\n

             <\/p>\n

             <\/p>\n\n<\/div>

            None<\/h2>\n
            \n\n

            None<\/h2>\n