Hacker News Reader

Oh, come on, the solution is trivial.

So trivial that I can't really see what's there to abstract. It's literally a one liner in Python.

[x for x in my_list if x % 2 == 0] + [x for x in my_list if x % 2 != 0]

That doesn't re-build it into a linked list as his example showed. It also does multiple passes through the data, which should be fun if there are millions of items.

It is a great question for talking about performance tuning an algorithm, but just seems bizarre to be pushing for abstraction on this problem.

Maybe something like

lambda f: [x for x in my_list if f(x)] + [x for x in my_list if not f(x)]

Reply on news.ycombinator.com