Just the a first post, really not supposed to be revolutionary. I wanted to get the Hugo setup working and verify that my plotly integration is correctly set.
I remember the first time a professor showed me the following graph.
It’s quite cool to see how theory actually matches practice. Notice that this is starting from a randomly shuffled array.
If we take a nearly sorted array, we get a different picture:
Of course we can play with the implementations and create “shortcuts” to make each algorithm faster. What I like here is that it’s not always the fastest algorithm that wins, but the one that is the most appropriate for the problem.