Downloaded 23 times
![Explanation With Algorithm
• 1. Set K=1 and Loc=0
2. Repeat Steps 3 and 4
while K<=N
3. if key=LA[K], then Set
Loc=K,
print: Loc and Exit
4. Set K=K+1
5. if Loc=0 then Write:
Item in List
6. Exit](https://image.slidesharecdn.com/datastructurelinearsearch-150416141720-conversion-gate01/85/Data-structure-linear-search-4-320.jpg)
Uploaded byStamford university Bangladesh
Data structure linear search
The document summarizes a presentation given by Md. Abdullah-Al-Faisal and Md. Muntasir Mamun to Asma-Ull-Hosna on the topic of linear search. It defines linear search as checking each element in a list sequentially to find a desired element, with the list not needing to be ordered. An algorithm for linear search is provided that sets a counter K to 1, checks if the search key equals the element at the current index, increments K if no match, and exits if either a match is found or all elements are checked without a match.
Data structure linear search
- 1. DATA STRUCTURE PRESENTATION • PresentedTo : Asma-Ull-Hosna Lecturer Dept. of CSE Stamford University Bangladesh • Presented By : Name : Md. Abdullah-Al-Faisal ID : CSE 05506813 Name : Md. Muntasir Mamun ID : CSE 05506814
- 2.
- 3. DEFINITION • In computerscience, linear search or sequential search is a method for finding a particular value in a list that checks each element in sequence until the desired element is found or the list is exhausted. The list need not be ordered.
- 4. Explanation With Algorithm •1. Set K=1 and Loc=0 2. Repeat Steps 3 and 4 while K<=N 3. if key=LA[K], then Set Loc=K, print: Loc and Exit 4. Set K=K+1 5. if Loc=0 then Write: Item in List 6. Exit
- 5.
- 6.