Recurrence Relation for Stooge Sort?
could anyone help me through figuring out what a recurrence relation for
Stooge sort would be? I don't need to solve it, I just need to figure out
the relation. I know Stooge Sort has O(n^log3/log1.5) time. I'm just
unsure how to progress from there...
Thanks!
No comments:
Post a Comment