Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.03 s | 3 KBi |
#2 |
Correcto
|
0.027 s | 3 KBi |
#3 |
Correcto
|
0.027 s | 3 KBi |
#4 |
Correcto
|
0.021 s | 3 KBi |
#5 |
Correcto
|
0.022 s | 3 KBi |
#6 |
Correcto
|
0.026 s | 7 KBi |
#7 |
Correcto
|
0.029 s | 3 KBi |
#8 |
Correcto
|
0.029 s | 3 KBi |
#9 |
Correcto
|
0.028 s | 3 KBi |
#10 |
Correcto
|
0.027 s | 3 KBi |
#11 |
Correcto
|
0.068 s | 3 KBi |
#12 |
Correcto
|
0.06 s | 3 KBi |
#13 |
Correcto
|
0.056 s | 3 KBi |
#14 |
Correcto
|
0.075 s | 3 KBi |
#15 |
Correcto
|
0.054 s | 3 KBi |
#16 |
Correcto
|
0.081 s | 3 KBi |
#17 |
Correcto
|
0.038 s | 3 KBi |
#18 |
Correcto
|
0.075 s | 3 KBi |
#19 |
Correcto
|
0.049 s | 3 KBi |
#20 |
Correcto
|
0.039 s | 3 KBi |
def bubblesort(arr, num_elements): for i in range(num_elements-1): for ii in range(0, num_elements - i - 1): if (x0 := arr[ii]) > (x1 := arr[ii+1]): arr[ii:ii+2] = x1, x0 return arr def insertionsort(arr, num_elements): for i, x0 in enumerate(arr): for ii, x1 in enumerate(arr[:i]): if x0 < x1: arr[ii+1:i+1] = arr[ii:i] arr[ii] = x0 break return arr if __name__ == "__main__": num_elements = int(input()) arr = list(map(int, input().split(' '))) sorted_arr = insertionsort(arr, num_elements) print(' '.join(map(str, sorted_arr)))