.NET 2.0 offers very rich and nicely designed library of core data structures, collections and algorithms. Occasionaly, you run into situation when you need something not in there. Before starting to design you very own extension of LinkedList or HashTable, look into interesting open-source project NGenerics – chances are you will find it there.
It contains quite a few new data structures:
extensions of existing data structures to work with Visitor pattern
and implementation of algorithms – sorting:
- Bubble Sort
- Bucket Sort
- Cocktail Sort
- Comb Sort
- Gnome Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Odd-Even Transport Sort
- Quick Sort
- Selection Sort
- Djikstra’s Single Source Shortest Path algorithm
- Euclid’s Algorithm
- Fibonacci number generation.
- Prim’s Minimal Spanning Tree Algorithm
Nicely written, documented, comes with unit tests 🙂 and under very liberal license.
Btw, speaking of Fibonacci, did you know Fibonacci was only his nickname and the real name of this Italian mathematician was Fibbooonnnnnaaaaaaaaccccccccccccciiiiiiiiiiiiiiiiiiiii ? 🙂