Class Notes (835,006)
Canada (508,865)
COMP 2710 (31)
Tina Yu (20)
Lecture

140226 - Ch 14 Sorting - Linear and Merge.doc

2 Pages
63 Views
Unlock Document

Department
Computer Science
Course
COMP 2710
Professor
Tina Yu
Semester
Fall

Description
Midterm Q6 Make upSame question Printing the output questions2012030 48 In an array of size n count how many times an array element is visitedTo find the smallest visit n elements2 visits for the swapN2To find the next smallest visit n1 elements2 visits for the swapn12n22n32The last term is 2 elements visited to find the smallest2 visits for the swap22Add them together2N25n2325n 2 3 is small compared to n2 so ignore itAlso ignore the 12 it can
More Less

Related notes for COMP 2710

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