python运行效率低下_有没有实际的例子来说明python的效率低下

一个使用插入排序的实际比较，如您所见，C要快得多。请注意，这些都是1对1的尝试，在现实世界中，您只需使用Python的sort，它使用https://en.wikipedia.org/wiki/Timsort，效率要高得多。结果：

Pythonreal 0m0.034s

user 0m0.028s

sys 0m0.008s

C

^{pr2}$

Python中的第一个#!/usr/bin/python

a = [16, 7, 4, 10, 18, 15, 6, 12, 13, 5, 11, 14, 17, 8, 2, 9, 19, 3, 1]

print 'Unsorted: %s' % a

def insertion_sort(a):

for j in range(1, len(a)):

key = a[j]

i = j - 1

while i >= 0 and a[i] > key:

a[i+1] = a[i]

i = i - 1

a[i+1] = key

return a

# execute the sort

print 'Sorted: %s' % insertion_sort(a)

C中的第二个#include

#include

/*

Compile with:

cc insertion-sort.c -o insertion-sort

*/

int main(int argc, char **argv)

{

int a[20] = {16, 7, 4, 10, 18, 15, 6, 12, 13, 5, 11, 14, 17, 8, 2, 9, 20, 19, 3, 1};

int i, j, key;

int len = 20;

printf("Unsorted: [");

for ( i = 0; i < len; i++ ) {

printf(" %d ", a[i]);

}

printf("]\n");

for ( j = 0 ; j < len ; j++ )

{

key = a[j];

i = j - 1;

while ( i >= 0 && a[i] > key ) {

a[i + 1] = a[i];

i = i - 1;

}

a[i + 1] = key;

}

printf("Sorted: [");

for ( i = 0; i < len; i++ ) {

printf(" %d ", a[i]);

}

printf("]\n");

}