Class Notes (839,150)
Canada (511,218)
CMPT 225 (60)
John Edgar (28)
Lecture 5

CMPT 225 Week 5 Lecture 2

2 Pages
103 Views

Department
Computing Science
Course Code
CMPT 225
Professor
John Edgar

This preview shows 80% of the first page. Sign up to view the full 2 pages of the document.
Description
Quicksort Continued Every partition step requires less work.Amount of work doing is ~number of items in array (holds up better if the array is larger). How many times does n have to be divided in half before the result is 1? log2(n) times Quicksort performs n*log2(n) operations in the best case. Incomparably better than insertion and selection sort! Worst case: pivot is smallest or largest value.Absolute worst is where this is basically every case -> doesn't divide sub array in half at all, just finds correct place for one value at a time. Partitions either into smaller or larger values, not both. In this case, array has to be partitioned (roughly) n times (actually n-1) Worst case performance: around n^2 operations (or n-1 * n or something) Worst case usually occurs when array is nearly sorted in either direction In this case, insertion sort would actually be extremely fast. Typically much more concerned about worst case than best case. For example, when you have very specific time requirements. If you're unlucky, you may run into huge problems. So you choose a different algorithm instead. Worst case is very unlikely to happen, esp with larger arrays.Average case is much, much closer to best case. Think of randomly arranged data. What is the likelihood for it to be sorted? VERY, VERY SMALL. Can fix a partially sorted array so it's ready for Quicksort. Multiple ways to do that. Go one pass through the array and r
More Less
Unlock Document

Only 80% of the first page are available for preview. Some parts have been intentionally blurred.

Unlock Document
You're Reading a Preview

Unlock to view full version

Unlock Document

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit