Sorting Character array using Qsort, C (gcc)

Sorting Character array using Qsort

/*Program to do Qsort and bsearch on Integer , character . 
First sort the array and then search for it */
#if 1
#include<stdio.h>
#include<stdlib.h>
typedef struct
{
    int one;
    char two;
}Numbers;
int fn1(Numbers *x, Numbers *y);
char fn2(Numbers *x1, Numbers *y1);
void getintdone();
void getchardone();
char fn2(Numbers *x1, Numbers *y1)
{
    char a2,b2;
    a2=x1->two;
    b2=y1->two;
    return a2-b2;
}
int fn1(Numbers *x, Numbers *y)
{
    int a1,b1;
    a1=x->one;
    b1=y->one;
    return a1-b1;
}
void getchardone()
{
    Numbers g[5],finde;
    Numbers *five=NULL;
    g[0].two='Z';
    g[1].two='A';
    g[2].two='X';
    g[3].two='B';
    g[4].two='G';
    finde.two='G';
    int j;
  //  printf("The Unsorted Array is : %d \n",x.one );
    qsort(g,5,sizeof(Numbers),fn2);
    for(j=0;j<5;j++)
    {
        printf("The Sorted Array is: %c \n", g[j]);
    }
    five=bsearch(&finde,g,5,sizeof(Numbers),fn2);
        if(five!=NULL)
    {
        printf("The value is found : %c \n", *five);
    }
    else
    {
        printf("Not Found \n");
    }
}
void getintdone()
{
   Numbers x[5],find;
    Numbers *four=NULL;
    x[0].one=5;
    x[1].one=15;
    x[2].one=2;
    x[3].one=35;
    x[4].one=99;
    find.one=99;
    int i;
  //  printf("The Unsorted Array is : %d \n",x.one );
    qsort(x,5,sizeof(Numbers),fn1);
    for(i=0;i<5;i++)
    {
        printf("The Sorted Array is: %d \n", x[i]);
    }
    four=bsearch(&find,x,5,sizeof(Numbers),fn1);
        if(four!=NULL)
    {
        printf("The value is found : %d \n", *four);
    }
    else
    {
        printf("Not Found \n");
    }
    
} 
int main()
{
    getintdone();
    getchardone();
       return 0;
}
#endif


run \| edit \| history \| help	1