Yan Cui
I help clients go faster for less using serverless technologies.
Here’s a simple F# implementation of the merge sort algorithm (using mutable arrays) outlined in the Algorithms : Design and Analysis Part 1 course on Coursera.
So refreshing to be writing simple sorting algorithms years after university, still fun! 
Whenever you’re ready, here are 3 ways I can help you:
- 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 to level up your serverless skills quickly.
- 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.
- 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.
Very cool. I’m getting ready to take the Algorithms: Design and Analysis course in October. I’ve previewed the first week and it seems really interesting. It is quite a bit of fun implementing these algorithms. I implemented this one first in Python, but I quickly run out of stack when sorting things. Of course I could get around this using a non-recursive method, but that method doesn’t speak as much to the part of me that loves math. I was going to try it using F#, but I wanted to see what other F# solutions there were out there. Thanks for sharing.