Not circular lists though... I've already done a basic version in CL. I might flesh that out a bit more sometime later.
Never ran into a case where I'd actually use it though.
I tend to do a lot of game and simulations which have players taking turns in a circular fashion (ie the last player is followed by the first player). A non-circular list would work, but the special case code for when you reach the end of the list and want to start back at the beginning is pretty lame.
Heaps in C#
. Again, I haven't run into an real world use case for it...
Oh, come on... for heaps?! You've been web programming again, huh?! =)
I'll check out that F# implementation of the binomial heap later. I'm surprised that a binary heap wasn't included in the .NET libs. Actually, I'm just assuming that this is true because of the Microsoft employee writing his own. IIRC, the Java API version is kind of a pain to use. Anyways... binary heaps are cool... I suppose... if you're not already familiar with fib heaps! =)
I have a Sudoko solver around somewhere... was written a LONG time ago. Probably just after it became "popular". We could design that and see how well the old code works?
That could be interesting. I actually have two versions in Java. I had to basically create a Prolog like environment and solver in one of my grad classes. That was an "interesting" project. The other one is a fairly standard backtracking solution.
Norvig has a good write up for a Sudoku solver using constraint satisfaction and backtracking that I wouldn't mind doing in Java and CL.
Computational geometry could be interesting...
Famous last words... =)
I'm pretty booked this week. Maybe we can get something started over the weekend.