🌳 Comparison-Sorting Lower Bound: Decision Trees and log2(n!)
Build the complete decision tree of insertion, binary-insertion and merge sort for up to six items in a Blender-built 3D scene, and see why no comparison sort can beat ceil(log2 n!) comparisons.
⚙ Under the hood
See the real decision tree of insertion, binary-insertion and merge sort for up to six items in a Blender-built 3D scene, and why no comparison sort can use fewer than ceil(log2 n!) comparisons.
sortingdecision treeinformation theorylower boundalgorithmsBlenderThree.js
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install