1.00/1.001  Intro Comp & Engr Prob Solving

If you are one of the students who has received a loaner laptop for 1.00, make sure you bring it to the exam. An IS&T representative will be there, in Johnson, to pick them up from 3:30-4:30, during the last hour of the exam.

Good luck with your preparation!

Apparently, in the review session, I swapped what were the best and worst cases for insertion sort.  Please check and confirm for yourselves, that the best case for insertion sort (i.e. O(n)) is when the list is sorted, and that the worst case (O(n^2)) is when the list is reverse-sorted.  Again, questions?  Email me.

-P

Hi all,
   I'm worried that I may have given you all the wrong idea in terms of insertion sort yesterday (and hence, maybe sorting in general).  Remember that when we do analysis of sort methods, we want to take into account not only the number of comparisons we do (is 3 < 2 ?), but also any shifting of elements we do.  So if, for every element in an array, we (in the worst case), must move O(n) elements to set it in place, the run time of the alg will be O(n^2)....
   With that in mind, please take another look over the sorting lectures if you're not entirely comfortable with it.  If you have questions, please don't hesitate to email me.

Good luck all,

P

Hi all-
  For tomorrow's review session, I'll be using a new system to figure out what it is that you'd all like to go over.  With that in mind, please check out: http://moderator.appspot.com/#16/e=6e262

See you tomorrow,

P

Hi Folks-
   Due to a conflict, I won't be able to start office hours until 4:30.  Apologies for the late notice.  Please do come by if any concept from the class is not clear, or even if you just want to shoot the breeze.

-P