Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 3 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#11 |
Correcto
|
0.004 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#include <stdio.h> #include <stdlib.h> int main () { long int size_array = 0, num_array = 0, i, aux; long int *array = NULL; scanf("%li", &size_array); array = malloc(sizeof(long int) * size_array); if (array == NULL || size_array <= 0) return -1; for(i = 0; i < size_array; i++) { scanf("%li", &num_array); array[i] = num_array; } aux = array[0]; for(i = 1; i < size_array; i++) { if (array[i] < aux) { printf("Desordenado\n"); return 0; } aux = array[i]; } printf("Ordenado\n"); return 0; }