8. Algorithm Case Study

Binary search works on both sorted and non-sorted arrays.

With Sequential search having an average O(N) and Binary search having an average O(logN), Which is quicker to use?

When dividing a list in twos what do you do when its not evenly divided by power of 2?

Any linear ordering of all of the vertives in which all the arrows go to the right that is a valid solution.

if doing a sequential search what is the worst case in terms of big O ?

Under what condition would the big O for binary search be 1 + log_2(n)?

What is the worst-case number of iterations for binary search?

Sequential(Linear) search may be more suited to keep the array sorted if the user inserts more items than searching for them.

What is the worst case for a sequential search?

What is a sequential search?

The worst case for the second algorithm shown during the case study video is:

Which is true of a sequential search and a binary search?

When dealing with smaller numbers of n sequential searching and binary search do not have much difference with growth rate. It is until n gets into the 1000’s that the difference becomes greater.

The following description of sequential search is T/F ? sequential search: loops through a list and stops if the item is found worst-case is O ( N ) average-case is O ( N/2 ) = O ( N ) best case is O ( 1 )

If you have a sorted array, which searching alogrithm is better binary or sequential?