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!
Background reading on the reference counting vs tracing garbage collection debate - Eight years ago I answered a question on Stack Overflow about the suitability of OCaml and Haskell for soft real-time work like visualization: "*for real-ti...
4 months ago