F# – counting inversions

This is a F# implementation of the fast algorithm to count the number of inversions in an array, outlined in the Algorithms : Design and Analysis Part 1 course on Coursera.


Learn to build Production-Ready Serverless applications

Want to learn how to build Serverless applications and follow best practices? Subscribe to my newsletter and join over 5,000 AWS & Serverless enthusiasts who have signed up already.

Leave a Comment

Your email address will not be published. Required fields are marked *