The optimal complexity of a sorting network of fixed width numbers is bound by depth O(log n). [1] I'm not sure how to go about analyzing bread sort, but it do

The optimal complexity of a sorting network of fixed width numbers is bound by depth O(log n). [1] I'm not sure how to go about analyzing bread sort, but it does seem bound by aligning and inserting the beads into each column which would be at least O(log n), the number of digits. But, I'd be surprised if it is optimal. [1] https://www.researchgate.net/publication/220329153_An_Optimal_Hardware-Algorithm_for_Sorting_Using_a_Fixed-Size_Parallel_Sorting_Device https://www.researchgate.net/publication/220329153_An_Optima...