CS 106B Study Guide - Midterm Guide: Merge Sort
9 Jan 2019
School
Department
Course
Professor
Document Summary
As a class, you knocked this one out of the park. We believed the exam to be fair but not unduly easy, so most of you can take real pride in doing so well. Given the independent corroborative evidence from the section leaders who tell me that things are going well, i"ve decided to assign a high curve of the sort i think you deserve. The complete histogram appears on page 2, but here are a few noteworthy statistics: The scale to letter grades looks like this: Problem 1: tracing c++ programs and big-o (10 points) Just like the mystery function on the first practice exam (handout #23), this version of mystery calculates 2n, this time using an iterative version of the raiseinttopower algorithm from problem 4 on that same practice exam. The number of times the loop executes is therefore proportional to log2 n, which means that the computational complexity is o(log n).
