The F# Journal just published an article about a Big Data algorithm:
"Finding pairs of items that appear together often in large datasets is a popular challenge. This is increasingly posed as an interview question in the context of Big Data. This article takes a look at a simple challenge that was posed in an interview and solves the problem used a variety of different approaches...."
To read this article and more, subscribe to The F# Journal today!
OCaml faster than Rust - Rust is a new "systems programming language" that is claimed to be "blazingly fast". We put it to the test, pitting it against the F# programming languag...
9 months ago