Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.027 s | 3 KBi |
#2 |
Correcto
|
0.02 s | 3 KBi |
#3 |
Correcto
|
0.02 s | 3 KBi |
#4 |
Correcto
|
0.03 s | 3 KBi |
#5 |
Correcto
|
0.019 s | 3 KBi |
#6 |
Correcto
|
0.03 s | 3 KBi |
#7 |
Correcto
|
0.023 s | 3 KBi |
#8 |
Correcto
|
0.02 s | 3 KBi |
#9 |
Correcto
|
0.023 s | 3 KBi |
#10 |
Correcto
|
0.02 s | 3 KBi |
#11 |
Correcto
|
0.181 s | 3 KBi |
#12 |
Correcto
|
0.185 s | 3 KBi |
#13 |
Correcto
|
0.108 s | 3 KBi |
#14 |
Correcto
|
0.078 s | 3 KBi |
#15 |
Correcto
|
0.072 s | 3 KBi |
#16 |
Correcto
|
0.129 s | 3 KBi |
#17 |
Correcto
|
0.296 s | 3 KBi |
#18 |
Correcto
|
0.092 s | 3 KBi |
#19 |
Correcto
|
0.107 s | 3 KBi |
#20 |
Correcto
|
0.139 s | 3 KBi |
import time 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 def selectionsort(arr, num_elements): for i, x0 in enumerate(arr): x_min, argmin = x0, i for ii, x1 in enumerate(arr[i:], start=i): x_min, argmin = (x_min, argmin) if x1 >= x_min else (x1, ii) arr[i], arr[argmin] = x_min, x0 return arr if __name__ == "__main__": num_elements = int(input()) arr = list(map(int, input().split(' '))) # Use a different sort every minute sorts = [bubblesort, insertionsort, selectionsort] sort_idx = int(time.time() / 60) % len(sorts) sorted_arr = sorts[sort_idx](arr, num_elements) print(' '.join(map(str, sorted_arr)))