Set: Sorting and Searching Performances

Familiarize

Learn

Test

Play Scatter

Play Space Race

Learn, the most powerful study mode, requires free Quizlet membership.

Combine with other sets Login to add to Favorites
Print: Term List | Flashcards Editing not allowed
Export Deleting not allowed

Sharing

With group: None (edit)
HTML link to set: Plain link:
Share on Facebook Share on MySpace

All 18 Terms

Term Definition
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

Set Information

Terms 18
Creator jalenack
Created April 15, 2006
Groups None
Tags java, apcompsci, abtest
Access Anyone
Edit Creator Only

Description

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.

Pop out

Discuss

runeaddict : :O
Last Message: 16 months ago

You must be logged in to discuss this set.

Top Users

  1. jalenack - 19 scores
  2. NeilKelty - 19 scores
  3. jackofspades - 18 scores
  4. jsamraj - 1 score

Most Missed Words

  1. 1 → +Sequential Search - 1 miss
  2. n → -Sequential Search - 1 miss
  3. 1 → +Binary Search - 1 miss
  4. log n → -Binary Search - 1 miss
  5. n^2 → All Selection Sort - 1 miss
  6. n → +Insertion Sort - 1 miss
  7. n^2 → -Insertion Sort - 1 miss