Issue 544113: merging sorted sequences (original) (raw)

Issue544113

Created on 2002-04-15 11:42 by s_keim, last changed 2022-04-10 16:05 by admin. This issue is now closed.

Messages (3)
msg39596 - (view)	Author: Sebastien Keim (s_keim)	Date: 2002-04-15 11:42
This patch is intended to add to the bisect module a function witch permit to merge several sorted sequences into an ordered list.
msg39597 - (view)	Author: Guido van Rossum (gvanrossum) *	Date: 2002-07-27 22:23
Logged In: YES user_id=6380 Thanks. This doesn't strike me as a "fundamental" algorithm like bisection or heap sort. I don't think I've ever needed this, except perhaps in situations where the amount of data was small enough that simply concatenating the lists and sorting them was an acceptable 3-line solution. Therefore I'm rejecting this unless you get someone of importance to plead for it.
msg39598 - (view)	Author: Sebastien Keim (s_keim)	Date: 2002-07-30 12:31
Logged In: YES user_id=498191 I must agree that it's not something that is needed everyday, I will put it in the Cookbook.