Several magical libraries in Python (not to be continued)

1.bisect: Use the dichotomy to find the appropriate insertion position in a sorted sequence.

>>>import bisect>>>l = [10,19,88,90]>>>bisect.bisect (l, a) >>>2   # The position suitable for insertion is 2bisect.bisect_left (l,  #如果已经在列表中存在) and returns to the left position Bisect.insort_left (l,22)  #插入

2.HEAPQ: Fully balanced binary tree, all nodes are smaller than their child nodes.

From HEAPQ import *from random Import *l = sample (Xrange (+), ten) heap = []print lfor i in L:heappush (heap, i) Print Heappo P (Heap)   #弹出的是列表里最小的.

Nlargest (5, L) returns the  ordered largest n elements from the list nsmallest (5, L) returns the smallest n elements

　　

Several magical libraries in Python (not to be continued)