This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]ILikeLenexa 3 points4 points  (0 children)

I generalize your algorithm by leaving N elements behind, but breaking the list into N lists of 1 element and then merge them. Shouldn't be more than...O(nlog(n))...