Bisect, is it possible to work with descending sorted lists?

Question

How can I use bisect module on lists that are sorted descending? e.g.

import bisect

x = [1.0,2.0,3.0,4.0] # normal, ascending
bisect.insort(x,2.5)  # -->         


        

Answer 1

You can insert like this

bisect.insort_left(lists, -x)

and extract elements like this

value = - lists[i]