Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.012 s | 3 KBi |
#2 |
Incorrecto
|
0.009 s | 3 KBi |
#3 |
Incorrecto
|
0.011 s | 3 KBi |
#4 |
Incorrecto
|
0.009 s | 3 KBi |
#5 |
Incorrecto
|
0.012 s | 3 KBi |
#6 |
Incorrecto
|
0.01 s | 3 KBi |
#7 |
Incorrecto
|
0.011 s | 3 KBi |
#8 |
Incorrecto
|
0.012 s | 3 KBi |
#9 |
Incorrecto
|
0.01 s | 3 KBi |
#10 |
Incorrecto
|
0.013 s | 3 KBi |
#11 |
Incorrecto
|
0.008 s | 3 KBi |
#12 |
Incorrecto
|
0.01 s | 3 KBi |
#13 |
Incorrecto
|
0.008 s | 3 KBi |
#14 |
Incorrecto
|
0.009 s | 3 KBi |
#15 |
Incorrecto
|
0.014 s | 3 KBi |
#16 |
Incorrecto
|
0.008 s | 3 KBi |
#17 |
Incorrecto
|
0.008 s | 3 KBi |
#18 |
Incorrecto
|
0.008 s | 3 KBi |
#19 |
Incorrecto
|
0.011 s | 3 KBi |
#20 |
Incorrecto
|
0.012 s | 3 KBi |
#21 |
Incorrecto
|
0.01 s | 3 KBi |
#22 |
Incorrecto
|
0.013 s | 3 KBi |
#23 |
Incorrecto
|
0.008 s | 3 KBi |
#24 |
Incorrecto
|
0.012 s | 3 KBi |
#25 |
Incorrecto
|
0.008 s | 3 KBi |
#26 |
Incorrecto
|
0.011 s | 3 KBi |
#27 |
Incorrecto
|
0.015 s | 3 KBi |
def bubblesort(lista): n = len(lista) for i in range(n-1): 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 if __name__ == '__main__': lista = [3, 2, 1, 0, -1, 0, 7] bubblesort(lista)