0.2.5

Harold Howe — Mon, 13 Nov 2006 18:27:53 -0000

Added Sort, QuickSort, Partition, NthElement, and RandomShuffle.

0.2.4

Harold Howe — Mon, 02 Oct 2006 18:14:15 -0000

Added NextPermutation, PrevPermuation, and LexCompare.

0.2.3

Harold Howe — Sat, 30 Sep 2006 02:37:53 -0000

Added new algorithms: Search, SearchN, FindEnd, FindFirstOf, Rotate, and RotateCopy. Switched algorithms that compare for equality from IComparer<T> to IEqualityComparer<T>.

0.2.2

Harold Howe — Wed, 27 Sep 2006 22:55:26 -0000

Added binders and stock predicates. Started working on Sort and StableSort.

0.2.1 Release

Harold Howe — Tue, 26 Sep 2006 20:05:45 -0000

I have added more unit tests for the existing algorithms. Most of the algorithms now have a unit test. I also fixed bugs in the algorithms that were found during testing.

See the readme.txt file for a description of the library.

Initial pre-alpha release (0.2.0)

Harold Howe — Tue, 23 May 2006 23:03:04 -0000