Found an very good article on RS-Trees in Haskell (see: http://www.eecs.usma.edu/webs/people/okasaki/jfp99.ps) It heavyly uses pattern recognition to translate those pesky balance-rules into short code. Bellowe is the simple rewrite of the haskell-implementation in F# - enjoy
5 people like thisPosted: 6 years ago by Carsten König
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
3 people like thisPosted: 5 years ago by Cesar Mendoza
Simple n-gram algorithm implementation
Posted: 5 years ago by Daniil Frumin
Binary Search Tree and Depth-First Traversal (PreOrder, InOrder, PostOrder)
6 people like thisPosted: 3 years ago by Fabio Galuppo
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
6 people like thisPosted: 5 years ago by Cesar Mendoza
These are F# solutions of Ninety-Nine Haskell Problems which are themselves translations of Ninety-Nine Lisp Problems and Ninety-Nine Prolog Problems. The solutions are hidden so you can try to solve them yourself.
5 people like thisPosted: 5 years ago by Cesar Mendoza
Simple binary search of an array. Tests the array at the middle and divides the search space by half each time it looks for the target item. Returns the target item and how many iterations it took to get there
2 people like thisPosted: 4 years ago by devshorts