In [ ]:

    

#选择排序
import time
def choose():
    for i in range(10000):
        k = a[i]
        for j in range(10000):
            if a[j] < k:
                k = a[j]
                h = j
        a[j] = a[i]
        a[i] = k
for i in range(10000):
    a[i] = int(input())
t1 = time.time()
choose()
t2 = time.time()
print(t2-t1)

#快速排序
import time
def qsort(l,r,a):
    i = l
    j = r
    k = a[l]
    if l<r:
        while i < j:
            while (a[j]>=k) and (i<j):
                j -= 1
            if i<j:
                a[i] = a[j]
                i += 1
            while (a[i]<k) and (i<j):
                i += 1
            if i<j:
                a[j] = a[i]
                j -= 1
        a[i] = k        
        qsort(l,i-1,a)
        qsort(j+1,r,a)
s = [0 for i in range(10000)]
for i in range(10000):
    s[i] = int(input())
t1 = time.time()
qsort(0,9999,s)
t2 = time.time()
print(t2 - t1)
for i in range(10000):
    print(s[i],end=' ')
    
#内置函数
import time
for i in range(10000):
    a[i] = int(input())
t1 = time.time()
sort(a)
t2 = time.time()
print(t2-t1)