My simple genetic algorithm in Python for polynomial curve fitting

Take the shortest route, the one that nature planned Marcus Aurelius, Meditations Genetic algorithms are really interesting in my opinion. Not the most efficient, but rather beautiful in the way they work. I especially like them because of the similarities that they share with life. Genetic algorithms are special kind of algorithms that work by modelling how natural selection works in the real world. I shouldn’t need to explain how evolution works, but for the sake of it, here I go. We have several individuals in a population, given their environment, some of the individual are better suited and reproduce, …

Continue Reading

A new surprising sorting algorithm

Just a small post today. I stumbled upon a paper [1] on ArXiv recently on a surprising sorting algorithm that was discovered pretty recently (in October 2021). Here is a quick implementation I wrote in Python: It’s not the most efficient algorithm obviously, as it will always do n2 comparisons. It is an O(n2) algorithm in the best case and worst case scenario. There are much more advanced algorithms out there that go down to O(n log n) in average, so much faster and more efficient. This algorithm is more like a curiosity, based on how simply the sorting is …

Continue Reading