Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.024 s | 3 KBi |
#2 |
Correcto
|
0.027 s | 3 KBi |
#3 |
Correcto
|
0.025 s | 3 KBi |
#4 |
Correcto
|
0.03 s | 3 KBi |
#5 |
Correcto
|
0.032 s | 3 KBi |
#6 |
Correcto
|
0.027 s | 3 KBi |
#7 |
Correcto
|
0.029 s | 3 KBi |
#8 |
Correcto
|
0.031 s | 3 KBi |
#9 |
Correcto
|
0.029 s | 3 KBi |
#10 |
Correcto
|
0.028 s | 3 KBi |
#11 |
Correcto
|
0.636 s | 3 KBi |
#12 |
Correcto
|
0.582 s | 3 KBi |
#13 |
Correcto
|
0.728 s | 3 KBi |
#14 |
Correcto
|
0.696 s | 3 KBi |
#15 |
Correcto
|
0.361 s | 3 KBi |
#16 |
Correcto
|
0.454 s | 3 KBi |
#17 |
Correcto
|
0.752 s | 3 KBi |
#18 |
Correcto
|
0.707 s | 3 KBi |
#19 |
Correcto
|
0.633 s | 3 KBi |
#20 |
Correcto
|
0.453 s | 3 KBi |
""" Bubble sort technique """ n = int(input()) integers = input() a = list(map(int, integers.split(" "))) i = 0 while i < n: j = 0 k = 1 while k < n: if a[k] < a[j]: x = a[k] a[k] = a[j] a[j] = x j += 1 k += 1 i += 1 a = " ".join(str(number) for number in a) print(a)