A brief look at sorting algorithms that are ridiculous and should generally be avoided.

Photo by Jared Rice on Unsplash

Sorting is a fundamental necessity in computer programming, but not all sorting algorithms were “created equal”.

You probably know that the best complexity for comparison-based sorting is O(NlogN), but today we are going to discuss some revolutionary sorting algorithms that you better avoid using in your programs.

Hold on to…

A curated list of my favorite googling “tricks”

We all use Google on a daily basis, pretty frequently.
As a matter of fact, I think that since I was given my first PC at the age of 6 I was googling almost every single day (not counting the school field trip days before I had a smartphone).


Eliran Turgeman

Software Developer, Writing about Computer Science, Education, Programming, and Math. https://bio.link/eliran

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store