I’m not sure Big O notation applies when your n is literally infinite universes…
And actually, on an even more pedantic note (if possible), if you are iterating through each array until you find an item out of order, and repeat this on every array, I’m fairly certain it’s more than O(n). Less than O(n^2) too, so it’s probably O(n*log(n))…but I’m a little out of my depth here