[0.3.1] Latest build
[0.3.1] Bumped version to 0.3.1
[0.3.2] Latest build
[0.3.2] Added code to prevent the browser from taking a shit all over my array order
[0.3.2] Changed the length of data for a test

Did this to handle browsers that use different sorting algorithms based
on input size (yes, i am looking at you Chrome).
Now Chrome, for example, uses Insertion Sort when input size <= 22
and quick sort after it. Quick sort is NOT a stable sorting algo while
insertion sort is. Hence, all kinds of shit hit the fan when I tried
different input set sizes. It's fixed but might render stuff a li'l
slow.
My benchmarks tell me that this program is still at 22ms for searching
through a set of 13831 elements (in the worst case) so imo things are
still cool.
Still though, ffs, we need a proposal to make sorts stable.
[0.3.2] Updated changelog
[0.3.2] Bumped version to 0.3.2
[0.3.2] Ignored benchmarking data
[0.3.2] Bumped version to accomodate sort stability related fixes