Category Archives: Discussion

Professor Thiel will be covering our class next week while I’m away. Not all of you may know python, but it’s pretty easy to read even if you don’t know it. Professor Thiel has typed up mergesort in python and … Continue reading →

First version: procedure binary search (: integer, : increasing integers) while    if then  else if then location else location return location Second version: procedure binary search (: integers, , : increasing integers) if then  return else if ( and … Continue reading →

Exercise: Complete parts (b) and (c) below for your team. Team parentheses: Let be the number of ways of parenthesizing a product of numbers. Team binary rooted trees: Let be the number of full, binary, rooted trees with leaves. Team … Continue reading →

Exercise: Complete part (a) below for your team. Team parentheses: Let be the number of ways of parenthesizing a product of numbers. Team binary rooted trees: Let be the number of full, binary, rooted trees with leaves. Team triangulated polygons: … Continue reading →

In the following exercise, you will be defining sequences of numbers recursively. That means that a number in the sequence is defined in terms of the numbers coming before it. Exercise 1: Complete parts (a), (b), and (c) below for … Continue reading →

Here are two links that will be useful to have handy for Monday’s class: MTA Subway map A simpler version of the subway map Something you can think about before Monday is why 2 might be better than 1. Does … Continue reading →

Hi everyone. I see that many of you have submitted your Test #1 review exercises and are making corrections already…that’s great! I’ll take a look at them tomorrow after class. Don’t forget to tag your post with the category “Test … Continue reading →

Benjamin asked a great question after class today. The linear search algorithm is: procedure linear search(: integer, : distinct integers while( and )     if then location: else location:= return location We said that we were usually interested in … Continue reading →