Category Archives: Discussion

Mergesort in python

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

Posted in Discussion | 1 Comment

Two equivalent formulations of the binary search algorithm

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

Posted in Discussion | Leave a comment

March 30 Exercise (b) and (c) from lecture

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

Posted in Discussion | Leave a comment

March 30 exercise (a) from lecture

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

Posted in Discussion | Leave a comment

March 28 exercise from lecture

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

Posted in Discussion | Leave a comment

Links for Monday’s class

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

Posted in Discussion | Leave a comment

Quiz #4 Results

Below you’ll see photos of your graded group quizzes from last week. It was a fun exercise, but perhaps not the most successful one in the whole world. Both groups lost out by not explaining their steps, though both groups … Continue reading

Posted in Discussion, Quizzes | Leave a comment

Big O Example – Graph

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

Posted in Discussion | Leave a comment

Complexity of the linear search algorithm

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

Posted in Discussion | 2 Comments