‡Æ ÇMö9cs(dZded„Zded„ZdS(sBisection algorithms.csy|tjot|ƒ}nxE||jo7||d}|||jo |}n |d}q W|i||ƒdS(sAInsert item x in list a, and keep it sorted assuming a is sorted.iiN(shisNoneslensaslosmidsxsinsert(sasxsloshismids#/mit/python/lib/python2.0/bisect.pysinsorts   icsm|tjot|ƒ}nxE||jo7||d}|||jo |}n |d}q W|SdS(sFFind the index where to insert item x in list a, assuming a is sorted.iiN(shisNoneslensaslosmidsx(sasxsloshismids#/mit/python/lib/python2.0/bisect.pysbisects   N(s__doc__sNonesinsortsbisect(s#/mit/python/lib/python2.0/bisect.pys?s