Comment Comment by vman512 It's pretty easy to get to O(N^(3/2)) at least, since that is sqrt(N)^3Imagine an algorithm that re-arranges a list into a sqrt(N) by sqrt(N) grid, and does O(num_columns^2) work for each row. parent vman512 2 years ago
Imagine an algorithm that re-arranges a list into a sqrt(N) by sqrt(N) grid, and does O(num_columns^2) work for each row.