Advertisement Upgrade to remove ads

This is for the AB AP Computer Science test, which asks the performance measures of various sorting and searching algorithms. Consider all definitions to be wrapped in O(). + is best case, - is worst case, ~ is average.

1

+Sequential Search

n

-Sequential Search

n

~Sequential Search

1

+Binary Search

log n

-Binary Search

log n

~Binary Search

n^2

All Selection Sort

n

+Insertion Sort

n^2

-Insertion Sort

n^2

~Insertion Sort

n log n

All Merge Sort

n log n

+Quick Sort

n^2

-Quick Sort

1

+Hashtable (search)

1

~Hashtable

n

-Hashtable

n log n

All Heapsort

n log n

~Quick Sort

Please allow access to your computer’s microphone to use Voice Recording.

Having trouble? Click here for help.

We can’t access your microphone!

Click the icon above to update your browser permissions above and try again

Example:

Reload the page to try again!

Reload

Press Cmd-0 to reset your zoom

Press Ctrl-0 to reset your zoom

It looks like your browser might be zoomed in or out. Your browser needs to be zoomed to a normal size to record audio.

Please upgrade Flash or install Chrome
to use Voice Recording.

For more help, see our troubleshooting page.

Your microphone is muted

For help fixing this issue, see this FAQ.

Star this term

You can study starred terms together

NEW! Voice Recording

Create Set