George Sakkis <george.sak...@gmail.com> added the comment: Posted recipe at http://code.activestate.com/recipes/576712/. You were right, the implementation gets significantly hairier but I think it's worth having this option. It's also faster than using sorted/bisect as len(seq)/N increases and there is no pathologically high number of ties at the last position (as in your test case).
---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue5669> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
