compsci

There is no excerpt because this is a protected post.

[Read more]

I consider it highly unlikely that you would be asked to program a sort on the AP exam.  I would not be surprised, however, if you had a multiple choice question that does one of the following:

Shows you source code for a sort and asks you to analyze the Big-Oh runtime of the sort
Shows you [...]

[Read more]

On Wednesday, we should be able to finish up Heap Sort.  I have posted some results of sorting data with all of our sorts.  Check it out on the wall in the classroom.

[Read more]

We started working on sorting last week and will continue with sorts this week.  Last week we wrote Insertion Sort, which could be described like this:

Assume that the list of size 1 at index 0 is sorted.
Insert the first “unsorted” element into this list of size 1
Assume that the list of size 2 starting at [...]

[Read more]