Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.024 s | 3 KBi |
#2 |
Incorrecto
|
0.024 s | 3 KBi |
#3 |
Incorrecto
|
0.021 s | 3 KBi |
#4 |
Incorrecto
|
0.02 s | 3 KBi |
#5 |
Incorrecto
|
0.016 s | 3 KBi |
#6 |
Incorrecto
|
0.025 s | 3 KBi |
#7 |
Incorrecto
|
0.032 s | 3 KBi |
#8 |
Incorrecto
|
0.021 s | 3 KBi |
#9 |
Incorrecto
|
0.042 s | 3 KBi |
#10 |
Incorrecto
|
0.013 s | 3 KBi |
#11 |
Incorrecto
|
0.033 s | 3 KBi |
#12 |
Incorrecto
|
0.09 s | 3 KBi |
lista = [] n = len(lista) for i in range(n): print(i) for j in range(0, n-1-i): if lista [j] > lista[j+1]: print("Desordenado") else: print("Ordenado")