Patricia Trees

The F# Journal just published an article:
"The implementations of the Set and Map modules in both OCaml and F# happen to use AVL balanced binary search trees. There are many alternatives to choose from. Patricia trees are an alternative specialized to unsigned integer elements with the potential to outperform the more generic AVL tree, particularly when perfoming set-theoretic operations such as union, intersection and difference..."
If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!

The Lisp/Java challenge: optimization

The F# Journal just published an article:
"The previous article in this two-part series described a challenge that was posed on the internet around a decade ago and walked through the design and implementation of a simple solution. This final part of the series described a simple but highly-effective optimization that can be applied to the program to greatly improve its performance..."
If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!