Binary and Linear Search

Question 1

What is a Linear Search and how does it work?

Answer 1

Finds an item unsorted and sorted lists, starts at first item in the line and checks each 1 by 1 effective for small data sets not large ones

Question 2

Pseudocode for Linear Search

Answer 2

Found = False
Index = 0
While found == False and index < items. Lenth
 If items[index] == item_to_find then
 Found = True
 Else
   Index = Index + 1
End if
End While

Question 3

What is Binary Search

Answer 3

Efficient algorithm finding item in sorted data set, starts in the middle and repeatedly divides itself in half best for large data sets