The bug isn't in the language, you just disagree with some of the goals. It was designed for the compiler to be small and easy to write, with data types and operations that map directly to operations that most CPUs can perform.
Erlang has arbitrary length integers by default, and I've found it to be incredibly liberating.
I thought Erlang didn't even have random access. Might not be the best fit for an in-place quicksort.
Still, the formula low + (high - low)/2 keeps the integers smaller (assuming everything is positive). That is to say, it can work with larger values before requiring bignums compared to (low + high) / 2. On the other hand, it is more operations.
Big integer by default is a terrible idea. Just look at Python 3.
Python 2 was bigint by default. Not even going to deconstruct your argument past that
I didn't say it wasn't...?
I didn't say you didn't say it wasn't
It works fine in Common Lisp. What's the problem with it in Python?
Could you expand? The number tower is one of the things I happen to like about python 3, but apparently you think there's something wrong? Performance?
The bug is in the author's understanding of his choice of language. The language did a perfectly reasonable thing.