🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →
Log in
HomeClass Notes1,200,000US530,000

CS 2110 Lecture Notes - Lecture 11: Sorting Algorithm, Insertion Sort, Postcondition

76 views3 pages
browncrow417
14 Jun 2017
School
Cornell University
Department
Computer Science
Course
CS 2110
Professor
Gries

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Invariant: [0, i-1] sorted and [i, b. length()] unsorted. Each iteration pushes value of b[i] to sorted position and i = i+1 for (int i = 0; i= x. Invariant b[hj-1] <= x b[j] = x b[j+1t] = ? b[t+1k] >= x.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

CS 2110
Final Exam
Study Guide
CS 2110 Midterm: CS 211 Cornell 2006 Fall t2 Examst2cs211sp02
turquoisegnu128
CS 2110
Final Exam
Study Guide
CS 2110 Midterm: CS 2110 Cornell 2012 Fall Examsp2 Fall 10 Solutions
turquoisegnu128
CS 2110
Final Exam
Study Guide
CS 2110 Midterm: CS 2110 Cornell 2012 Fall Examsp2solcs211sp06
turquoisegnu128

Related Questions

11. Which choice below will cause all of the values stored in the array data to be printed out in reverse order? Check all that int'u data = 122, 17, 95, 16, 103, -14, 95); // Choice A for (int i = data.length; i >= 1; i--) { print (data[i] + " "); // Choice B for (int i = 1; i <= data.length; i++) { print (data (data.length-i] + " "); // Choice C for (int i = data.length-1; i >= 0; i--) { print (data[i] + " "); // Choice D for (int i = 0; i < data.length; i++) { print (data (data.length-1-i] + " ");

18. Which choice below will cause all of the values stored in the array data to be printed out in reverse order? int[] data = {22, 17, 95, 16, 103, -14, 95}; // Choice A for (int i = data.length-1; i >= 0; i--) { print (data[i] + " "); // Choice B for (int i = 0; i < data.length; i++) { print (data[data.length-l-i] + " "); C. Both A and B will print all of the elements in reverse order. D. Neither A nor B will print all of the elements in reverse order

4. Add the missing line to the code below so it produces the image shown. Makre ALL that apply. A sketc... int pos = 0; void draw() { for (int i = 1; i <= 10; i++) { rect (pos, pos, 10, 10); A. translate (10,10); B. pos = pos + 10; C. pos = i 10; D. none of the above