Sequential search algorithm
Step 6 (if step 2)
Set value of Found to yes
best case cost
1
Step 10 (after while if statement)
if found = no then
Step 4 (start of if)
if number is equal to the ith number on the list Ti, then
Step 8 (beginning of Else)
Else number is not equal to T
Step one: (get necessary variables)
Get values for Number T1... Tn, and N1 ..., Nn
Step two: (instantiate counter and boolean)
set the value of i to 1 and set the value of found to NO
Step 9 (increase counter)
Add one to the value of i
Step 3 (start of while)
While both (Found = no) and i<= n) do steps 4 through 7
worst case cost
n
Step 11 (body of second if)
print the message "not found"
Step 5 (if step 1)
print the name of corresponding person Ni