Re: which datastructure for fast sorted insert?

Collapse
This topic is closed.
X
X
Collapse
 
  • Page of 1
  • Time
  • Show
Clear All
new posts
Previous template Next
  • Terry Reedy
    #1

    Re: which datastructure for fast sorted insert?


    "Rares Vernica" <rares@ics.uci. eduwrote in message
    news:y1r1w3qan3 p.fsf@ics.uci.e du...
    | >>l=list(s)
    | >>l.sort()

    This can be condensed to l = sorted(s)

    | >>l
    | ['a', 'b', 'c']



    Tags: None
    Previous template Next
    Working...