CPSC 112 Midterm: CS 112 Yale 15Fall Exam2 Solution
Document Summary
Cis 110 fall 2015 introduction to computer programming. Check cover sheet for name, recitation #, pennkey, and signature. (1 point total) 1. 4) (1 point) the java expression 7 2 evaluates to: 5. For each of the arrays below, give the number of comparisons required to sort it using the specified algorithm. 2. 3) (3 points) using merge sort (recursively merge sort each half of the array, then merge the two halves. Arvind"s pug, like all members of toy breeds, loves toy. When arvind returned from india, he wrote this toy program just to celebrate. It reads n values from stdin (the first input value is n, just like on n-body and toy encryption) and does something. But when arvind asked what the program does, his pug just wagged his tail. The assembly comments are similar to x-toy"s, but not identical. (13 points total)
