Big Oh Notation

Question

What is the running time for:

-Linear Search

-Binary search

-bubble sort

For each algorithm above, why do they take the time that they do?

Answer 1

linear search is O(n) : one for loop passes through the array

binary search is O( log N) : Half the array gets searched

bubble sort is O(n^2) : for each pass of the array, performs another pass