A sorting algorithm with non-exponential computational complexity

It turns out that there is an analog sorting algorithm with linear computational complexity.

The algorithm is as follows: just cut sticks of a length proportional to each number you want to sort. Then you arrange them in the form of a vertical bundle. You hit the table with them. You lower your hand and the first one that sticks out will be the largest. You remove it and so on.

Why does this algorithm work? Because it uses properties of the physical world that digital computers ignore.

We had this fascinating conversation at the Immune Technology Institute.

Read more: https://manuherran.com/digital-computers-are-also-analog-machines/

Comments

No comments yet. Why don’t you start the discussion?

Leave a Reply

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