Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
qsort para struct
#include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct { char nombre[31]; int edad; } tipoPersona; int comparar(const void *pivote, const void *elemento) { tipoPersona *ptrPivote = (tipoPersona *) pivote; tipoPersona *ptrElemento = (tipoPersona *) elemento; if (strcmp(ptrPivote->nombre,ptrElemento->nombre) > 0) return 1; else return 0; } int main(void) { tipoPersona vector[5] = {{"JUAN",18},{"ANA",21},{"PEDRO",23},{"LUIS",19},{"WALTER",22}}; size_t i ; for (i = 0 ; i < 5 ; i++) printf("%s - %d\n",vector[i].nombre,vector[i].edad); qsort(vector,5,sizeof(tipoPersona),comparar); printf("============================\n"); for (i = 0 ; i < 5 ; i++) printf("%s - %d\n",vector[i].nombre,vector[i].edad); return 0; }
run
|
edit
|
history
|
help
0
Tree
Memory leak
bitwise operations
Avance de guia 4- Pregunta 1
ForU
Project 3 Part 1 v1.75
If then price calculation v1
experimento con quicksort
open(): No such file or directory
merge two dice clay to head sport green globe attacked me seven of prime minister fired