CS 1110, Week 13 Notes
CS 1110, Week 13 Notes CS 1110-002
Popular in Intro to Computing using Python
verified elite notetaker
Popular in ComputerScienence
This 1 page Class Notes was uploaded by Eunice on Sunday May 1, 2016. The Class Notes belongs to CS 1110-002 at Cornell University taught by Lee, Van Loan in Spring 2016. Since its upload, it has received 13 views. For similar materials see Intro to Computing using Python in ComputerScienence at Cornell University.
Reviews for CS 1110, Week 13 Notes
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 05/01/16
CS 1110 Van Loan and Lee Spring 2016 April 26: Review for Prelim 2 April 28 Sorting Methods o selection sort sort through a sequence of swaps ex. select a value from the left and swap with lower values on the right (list of integers) use a helper function remember, sort functions are void functions depends on n^2 (n being length) o merging two sorted lists into a single sorted list make smaller and smaller decks, merge them and sort the decks depends on n*log(n) (n being length) ex. compare each item in the two lists and append the smaller and move on mergesort(): divide and conquer technique (previous example, binary search) split lists (again and again) to sort and then merge o recursion! (a recursive code calls itself)
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'