#include<stdio.h>                    
                    
#include<stdlib.h>                    
                    
int commp(const void *a, const void *b)                    
{                    
 return ((int *)a)[0] - ((int *)b)[0];                    
}                    
                    
main()                    
{                    
 int i,a[5][2] = {2,0, 3,3, 4,5, 1,1, 99,22};                    
 qsort(a, sizeof(a)/sizeof(int)/2, 2*sizeof(int ),commp);                    
                    
 for(i = 0; i < sizeof(a)/sizeof(int )/2; i++)                    
 {                    
if(a[i][1] != 0)                    
{                    
printf("%d", a[i][0]);   

printf("\n");               
break;                    
}                    
 }                    
                    
 return 0;   
 
}                    


1
Press any key to continue


怎么为float数据排序计算？例如：a[5][2] = {2.01,0, 3.1,-3.2, 4,5, 1,1, 9.9,22};   

经过网上搜索qsort函数用法，问题有解了!

#include<stdlib.h>

int commp(const void *a, const void *b)
{
return *(double *)a > *(double *)b ? 1 : -1;
}

main()
{
 int i;
 double a[5][2] = {2.01,0, -3.1,-3.2, 4,5, 1,1, 9.9,22};
 qsort(a, sizeof(a)/sizeof(double)/2, 2*sizeof(double ),commp);

 for(i = 0; i < sizeof(a)/sizeof(double )/2; i++)
 {
if(a[i][1] != 0)
{
printf("%lf", a[i][0]);

printf("\n");
break;
}
 }

 return 0;
 
}


-3.100000
Press any key to continue

感谢版主：炎天的真心指教！

感谢指教；我是自学C语言的，书上确实没有这样的函数方法；

#include<stdio.h>                    
                    
#include<stdlib.h>                    
                    
int commp(const void *a, const void *b)                    
{                    
  return ((float *)a)[0] - ((float *)b)[0];                    
}                    
                    
main()                    
{   
    int i = 0;               
    float a[5][2] = {2.01,0, -3.1,-1, 4,5, 1,-1, 9.9,22};   
                  
    qsort(a, sizeof(a)/sizeof(float)/2, 2*sizeof(float ),commp);                    
                    
    for(i = 0; i < sizeof(a)/sizeof(float )/2; i++)                    
    {                    
       if(a[i][1] != 0)                    
       {                    
          printf("%-6.2f%-6.2f", a[i][0], a[i][1]);   

          printf("\n");               
          break;                    
       }                    
    }                    
                    
    return 0;   
 }


-3.10 -1.00
Press any key to continue

#include<stdio.h>                    
                    
#include<stdlib.h>                    
                    
int commp(const void *a, const void *b)                    
{                    
  return ((float *)a)[0] - ((float *)b)[0];                    
}                    
                    
main()                    
{   
    int i = 0;               
    float a[5][2] = {2.01,0, -3.1,-1, 4,5, 1,-1, 9.9,22};   
                  
    qsort(a, sizeof(a)/sizeof(float)/2, 2*sizeof(float ),commp);                    
                    
    for(i = 0; i < sizeof(a)/sizeof(float )/2; i++)                    
    {                    
       if(a[i][1] != 0)                    
       {                    
          printf("%-6.2f%-6.2f", a[i][0], a[i][1]);
          printf("\n");      
          if(a[i][1] == a[i+1][1])
          printf("%-6.2f%-6.2f", a[i+1][0], a[i+1][1]);

          printf("\n");               
          break;                    
       }                    
    }                    
                    
    return 0;   
 }

-3.10 -1.00
1.00  -1.00
Press any key to continue