F# – Simple QuickSort implementation

Yan Cui

I help clients go faster for less using serverless technologies.

This article is brought to you by

Is your CI build step taking too long? Try Depot for free today and experience up to 40x faster build speed!

Unlock faster CI for FREE

For illustration purposes only, here’s how you can implement the QuickSort algorithm in a few lines of code:

image

Note that I’ve not made the list generic to avoid complications and performance overheads associated with dealing with generics. Even then, my 5-line implementation pales in comparison with the built-in sort function:

image

This just goes to show how good the built-in functions are Winking smile!

In case you’re wondering how a generic version of my QuickSort implementation would do in comparison, here’s the results:

image

image

Generic equality or comparison is pretty slow, so where possible (not in this case unfortunately) you should mark functions that requires generic comparison ‘inline’ to boost performance.

Whenever you’re ready, here are 4 ways I can help you:

  1. Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
  2. Do you want to know how to test serverless architectures with a fast dev & test loop? Check out my latest course, Testing Serverless Architectures and learn the smart way to test serverless.
  3. I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
  4. Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.

1 thought on “F# – Simple QuickSort implementation”

Leave a Comment

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