Computes Levenshtein (min edit) distance between two strings http://en.wikipedia.org/wiki/Levenstein_Distance
6 people like thisPosted: 5 years ago by Lakret
The simplest F# semicoroutines via seq. comprehensions http://en.wikipedia.org/wiki/Coroutine Replaced a custom function with the pipeline operator.
1 people like thisPosted: 4 years ago by Lakret
Splits array into chunks, returning seq of seqs. Works with F# 3.x
1 people like thisPosted: 4 years ago by Lakret
It's fairly straightforward in-place QuickSort implementation which uses ThreadPool for parallelization. Still slower than library function Array.sortInPlace, though.
3 people like thisPosted: 5 years ago by Lakret
Bronâ€“Kerbosch algorithm is an algorithm for finding maximal cliques in an undirected graph http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm
1 people like thisPosted: 4 years ago by Lakret