-
-
Save parzibyte/e49ff4c911468fa6f4481fe13d30bb76 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
char palabras[][MAXIMA_LONGITUD_CADENA] = { | |
"Maria", | |
"Luis", | |
"Bojack", | |
"Leon", | |
"Maggie", | |
"Link", | |
"Mario", | |
"Claire", | |
"Zanahoria", | |
"Baroness Von Bon Bon", | |
}; | |
int longitud = sizeof(palabras)/sizeof(palabras[0]); | |
// Imprimimos el arreglo antes de ordenarlo, solo para ilustrar | |
printf("---Imprimiendo arreglo sin ordenar---\n"); | |
int i; | |
for (i = 0; i < longitud; i++) | |
{ | |
printf("%s\n", palabras[i]); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment