Jonathan Bernard

Australian Voting was an interesting project. Like the two projects previous, I had solved this problem before. However, last time I solved it, I did it in Java, and if I remember correctly, I proctrastinated and used a naive algorithm because I ran short on time. This time was quite different. CS371P is using C++, and Prof. Downing has added the following restrictions in the projects so far:

• No dynamic memory allocation (malloc()/free(), new/delete), aka no heap allocations.
• No STL containers

(more…)

Per Prof. Downing’s suggestions, here is a quick overview of Mercurial: (more…)

Project 2 just wrapped up, time for my post. Like the previous project, 3n+1, I have solved this problem before. My estimate for the time to complete the project was: about two hours for implementation and optimization; four hours for debugging, unit testing, documentation, and the other various tasks required for the project. The implementation and optimization time matched my expectations, but the various other tasks took about 5 hours total. I ran into a problem with the unit testing. I was working on that away from my partner and missed a simple mistake, little plug for pair programming there.

The time on the UVA machines for our submission varried by about .004 in either direction when we submitted. The best time I recieved from UVA was 0.096, ranked 380-ish last time I checked, but I may have been bumped down a bit (at the time of this post I can not reach the UVA site, hrmm).

Ok. Time to post about Collatz (3n+1 problem). I’ve been meaning to post to my blog about the class, especially since Downing is offering some extra credit to do so, but life is busy. So this is the first post from CS371P. (more…)