November 23rd, 2004

color cycle (slow)

Outsmart

It's fun to figure out something a professor overlooked. In CSE441, Dr. Sally Goldman informed us that a certain problem was lower bounded by 2n+1 comparisons; after class, I asked her if something I'd thought of would work, because I had an algorithm to do it in (n/2) + 1 comparisons. And it works. (Round the n/2 up.)

It's a good feeling to know that I understand the subject, y'know?
  • Current Mood
    geeky geeky