Binary Sorting

For a **binary** array $B$ of length $M$, we define a function $f(B)$ as follows. The following process is called a *pass* over the array: - For each index $i$ from $1$ to $M-1$ in order, if $B_i \gt B_{i+1}$, swap $B_i$ with $B_{i+1}$. For example, if $B = [1, 0, 1, 0, 0]$ then a single pass will turn it into $[0, 1, 0, 0, 1]$ because swaps will happen when checking indices $1, 3, 4$. A pass