The naive collision detection algorithm takes O(n^2) by checking pairwise intersection. To improve the performance, sort the objects by x coordinates, scan from left to right and only check intersection if a.right < b.left. This method can be extended into 2D to further eliminate the necessary comparisons. Finally, note that insertion sort is more performant on mostly sorted lists than quick sorts, so it's more suitable in this case.

An interactive introduction to four-color problem and zero-knowledge proof.

A gallery of interactive explanations. And the tool used to make these.

The internet's finest exhibition can only exist online. It offers a profound, hour-long journey into nostalgia.

A music keyboard that creates consonants for you automatically.

An interactive guide on SVG path directives.

Turing famously showed that computers can’t decide whether your code halts. But in 1951, Henry Rice proved a much more devastating result: “computers can’t decide anything interesting about your code’s input-output!”

A new chapter of busy-beavers on tigyog!

Air wave, oscillation and sound explained through an interactive article.

Very nice and simply explained theoretical computer science theorems!

An interactive demo on how ants follow simple rules to find near-optimal solutions to feeding and fighting problems.

Play with quantum experiments.

Very nice interactive explanation of complex systems as a study.

<blockquote>Experience the world of face detection algorithms in this freaky test.</blockquote>

<blockquote>interactive visuals, made from cable salad</blockquote>