Cod sursa(job #2829506)
| Utilizator | Data | 8 ianuarie 2022 17:59:25 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
def sort(i, j, a):
if(i > j):
return []
m = i
val = a[i]
for k in range(i + 1, j + 1):
if val >= a[k]:
m += 1
(a[m], a[k]) = (a[k], a[m])
(a[i], a[m]) = (a[m], a[i])
return sort(i, m - 1, a) + [val] + sort(m + 1, j, a)
with open("algsort.in", "r") as f, open("algsort.out", "w") as g:
n = int(f.readline())
a = []
for x in f.readline().split():
a.append(int(x))
sort(0, n - 1, a)
for x in a:
g.write(str(x) + ' ')
