Envío 7248
Problema 0xdd - Ordenar un arreglo pequeño
- Autor: Jorgito
- Fecha: 2024-02-19 23:24:13 UTC (Hace 3 meses)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.009 s | 3 KBi |
| #2 |
Correcto
|
0.012 s | 3 KBi |
| #3 |
Correcto
|
0.012 s | 3 KBi |
| #4 |
Correcto
|
0.012 s | 3 KBi |
| #5 |
Correcto
|
0.012 s | 3 KBi |
| #6 |
Correcto
|
0.011 s | 3 KBi |
| #7 |
Correcto
|
0.012 s | 3 KBi |
| #8 |
Correcto
|
0.009 s | 3 KBi |
| #9 |
Correcto
|
0.011 s | 3 KBi |
| #10 |
Correcto
|
0.01 s | 3 KBi |
| #11 |
Correcto
|
0.064 s | 3 KBi |
| #12 |
Correcto
|
0.051 s | 3 KBi |
| #13 |
Correcto
|
0.053 s | 3 KBi |
| #14 |
Correcto
|
0.066 s | 3 KBi |
| #15 |
Correcto
|
0.067 s | 3 KBi |
| #16 |
Correcto
|
0.059 s | 3 KBi |
| #17 |
Correcto
|
0.086 s | 3 KBi |
| #18 |
Correcto
|
0.055 s | 3 KBi |
| #19 |
Correcto
|
0.084 s | 3 KBi |
| #20 |
Correcto
|
0.063 s | 3 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
lista = [int(n) for n in input().split()]
def bubble_sort(lista):
n = len(lista)
for i in range(n):
for j in range(0, n-i-1):
if lista[j] > lista[j+1]:
lista[j], lista[j+1] = lista[j+1], lista[j]
return lista
bubble_sort(lista)
for num in lista:
print(num, end=" ")