SaverioMonaco / manim-icbics-algorithm

"I can't believe it can sort" algorithm visualized with manim

Visualization of "I can't believe it can sort" algorithm

Attempt to understand why the following algorithm works:

Algorithm: $ICan’tBelieveItCanSort(A[1..n])$ $\rule{8cm}{.01cm}$

for $i=1$ to $n$ do

$\quad$ for $j=1$ to $n$ do

$\quad\quad$ if $A[i] < A[j]$ then

$\quad\quad\quad$ swap $A[i]$ and $A[j]$

---

Made with Manim.

https://www.youtube.com/watch?v=8raee-rvBw0

References

• [1] $\space$Stanley P. Y. Fung. Is this the simplest (and most surprising) sorting algorithm ever? 2021. arXiv: 2110.01111 [cs.DS].
• [2] $\space$ Manim: https://github.com/ManimCommunity/manim