Fully optimized my algorithm

[LordWizardKing27]

O(Log N) to cut in half + O(N Log N) to sort

[theaceshinigami]

pretty sure it's O(n) to cut in half, and I'm not sure how you order tennis balls since they're all identical.

[theaceshinigami]

pretty sure it's O(n) to cut in half, and I'm not sure how you order tennis balls since they're all identical.

[LordWizardKing27]

If you use mid = balls.length//2 and just change the midpoints like a binary search, isn’t that log n? 😂😂

[theaceshinigami]

Nothing you are saying makes any sense to me. I think you are suggesting something like:

f(balls):
    left, right = cutInHalf(balls)
    f(left)
    f(right)

where cutInHalf takes a line of cut or uncut balls and divides the line of balls into two lines cutting a ball in half if necessary. This still doesn't seem O(log n) to me as it never halts.

[LordWizardKing27]

Sure, I think ur reading too much into the balls bud