![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1670562978084-Linear%20Search%20Program%20in%20C.jpg\")
<\/p>\n<\/p>\n
Linear search, a fundamental algorithm in computer science, is the simplest method for finding an element within a collection. While more sophisticated algorithms like binary search exist, linear search provides a solid foundation for understanding basic search operations. In this article, we delve into the world of linear search and explore how to implement a linear search program in the C programming language. Through this journey, we’ll unravel the underlying logic, analyze its efficiency, and gain insights into the broader realm of algorithmic problem-solving.<\/p>\n
A sequential search algorithm is another name for linear search. It is the most straightforward search algorithm. In a linear search, we just go through the list in its whole and match each element with the item whose position has to be found. The algorithm returns the item’s location if a match is made; otherwise, it returns NULL.<\/p>\n
It is frequently used to search for a certain element in an unordered list or a list where the entries are not sorted. The linear search’s worst-case time complexity is O(n).<\/p>\n
The steps used in the implementation of Linear Search are listed as follows –
\nFirst, we have to traverse the array elements using a for loop.
\nIn each iteration of for loop, compare the search element with the current array element, and –
\nIf the element matches, then return the index of the corresponding array element.
\nIf the element does not match, then move to the next element.
\nIf there is no match or the search element is not present in the given array, return -1.
\nNow, let’s see the algorithm of linear search.<\/p>\n
let’s say the array is X and the value is i;<\/p>\n
To find an element in the list below with the value k = 1, follow these steps.
\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1670562978183-Linear%20Search%20Program%20in%20C%201.png\")
\nArray to be searched for<\/p>\n<\/li>\n<\/ul>\n
Compare each element x with k starting with the first element.
\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1670562978183-Linear%20Search%20Program%20in%20C%202.png\")
<\/p>\n<\/li>\n
Return the index if x == k.
\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1670562978183-Linear%20Search%20Program%20in%20C%203.png\")
<\/p>\n<\/li>\n
Else, return not found.<\/p>\n<\/li>\n<\/ol>\n