L/B Search

Question 1

What’s linear search algorithm

Answer 1

Function linear_search(Array , value ):
Ptr = 0
While ptr <= len(A) and ptr[A] != value:
Ptr = ptr + 1
End while
If ptr. => len(A):
Return “failed”
Else
Return ptr
End if
End function

Question 2

Binary search algorithm iterative

Answer 2

Function Binary ( A, Value , low , high )
Found = false
If high < low then
Return “not in order”
End if
While found == False:
Mid = (low + high /2)
If A[mid]< value then
High = mid-1
Elif A[mid]> value then
Low = mid +1
Else
found = true
End if
Endwhike
Return mid
End function

Question 3

Linked list traversal - putting it in order

Answer 3

function outputLinkedListInOrder0
pt = start
repeat
node = node(pt)
return node
pir = node (pit -
until pt == 0 endfunction