Question 4: 130 points] Write a pseudo code for a simple linear search algorithm

Question

Question 4: 130 points] Write a pseudo code for a simple linear search algorithm that determines whether an unsorted array (i.e., an array with positive element values that are in no particular order) contains a specified search key (Note: Dot not sort the array.) Input: A sequence of n numbers A = (a,,a2 ,an)and a value v. Output: An index i such that: or the special value NIL ifv does not appear in A See incomplete pseudocode below, please indent your code properly. Line 1 given as a bonus to get you started on your pseudocode, feel free to change it, if you don't need it. Note that indexing of your array will start from linearSearch(A,v) a) Line l iH Line 2 llyour pseudo code goes here Line 3llyour pseudo code goes here Line Allyour pseudo code goes here Line Sllyour pseudo code goes here your code may be longer that 5 line..it is ok)

Explanation / Answer

Line 1

Line 2. Given an array A

4. a)

Line 1

Line 2. We have an array A = (a1,a2, a3, .... an) and and a value v.

Line 3. Traverse the array from first index to last index sequentially using loop

for (i = 1 to n)

if v = A[i]

Line 5. Return i

Line 6. if i = n+1

Line 7. Return NIL

Explanation : We start our search from first index of array to last one by one sequentially. If v is present in array A then it will return the index else it will return NIL.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.