Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Función quicksort para strings
#include <stdio.h> #include <stdlib.h> #include <string.h> //#define N 9 int compareStrings( const void *, const void * ); typedef char cadena[26]; int main(void) { int N = 5; int i; cadena vector[5] = {"MARIO", "PEDRO", "ANA", "JUAN", "WENCE"}; // Ordenamiento decreciente; qsort( vector, N, sizeof(cadena), compareStrings); for (i = 0 ; i < N ; i++) printf("%s ", vector[i]); return 0; } // 'a' representa el pivote, y 'b' es el elemento con el cual se compara el pivote. int compareStrings( const void *a, const void *b ) { char *ptrA = (char *) a; char *ptrB = (char *) b; /* if ( *ptrA == *ptrB) return 0; return ( *ptrA > *ptrB )? 1: -1;*/ //return *ptrA - *ptrB; return strcmp(ptrA, ptrB); }
run
|
edit
|
history
|
help
0
TopRightTriangle.c
CS HW2
stringify
c
blue point
Exploiting uninitialized variable
HW2A
Dynamic array
C_141126_ArrayMayorMenor01
Project 5 v.02