python中argsort_在基本python中等效Numpy.argsort()？

Boris Goreli..

60

我计时上面的建议,这是我的结果.

首先,功能:

def f(seq):

# http://stackoverflow.com/questions/3382352/equivalent-of-numpy-argsort-in-basic-python/3383106#3383106

#non-lambda version by Tony Veijalainen

return [i for (v, i) in sorted((v, i) for (i, v) in enumerate(seq))]

def g(seq):

# http://stackoverflow.com/questions/3382352/equivalent-of-numpy-argsort-in-basic-python/3383106#3383106

#lambda version by Tony Veijalainen

return [x for x,y in sorted(enumerate(seq), key = lambda x: x[1])]

def h(seq):

#http://stackoverflow.com/questions/3382352/equivalent-of-numpy-argsort-in-basic-python/3382369#3382369

#by unutbu

return sorted(range(len(seq)), key=seq.__getitem__)

现在,IPython会话:

In [16]: seq = rand(10000).tolist()

In [17]: %timeit f(seq)

100 loops, best of 3: 10.5 ms per loop

In [18]: %timeit g(seq)

100 loops, best of 3: 8.83 ms per loop

In [19]: %timeit h(seq)

100 loops, best of 3: 6.44 ms per loop

FWIW

有趣 - 可能平均值比3中的"最佳"更重要(？) (3认同)

对于未来的读者来说,`%timeit`报告的平均值是3个平均值,每个100个循环. (3认同)

平均值受到异常值的影响.您不希望运行的其他程序或硬件缓存未命中事件污染结果. (2认同)