Searching algorithms

Question 1

linear search

Answer 1

• start at array[0] and move sequentially throught the array until elementFound == true and return index of element in array
• In Big O, linear search is to the order of n. O(n) (not efficient)

Question 1

O(1)

Answer 1

• an algorithm that always executes in the same time (or space) regardless of size of input data set
• eg accessing an element in an array