浮点数排序算法

#include <iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

const double EPSILON = 1e-6;

bool cmp(double a, double b)

{

double temp1 = fabs(a-round(a));

double temp2 = fabs(b-round(b));

if(fabs(temp1 - temp2) < EPSILON)

{

return a < b;

}else

{

return temp1 < temp2;

}

}

double num[10];

int main()

{

int N;

scanf("%d", &N);

for(int i = 0; i < N; i++)

scanf("%lf", &num[i]);

sort(num, num+N, cmp);

for(int i = 0; i < N; i++)

{

if(i != N-1)

{

printf("%f ", num[i]);

}else

printf("%f\n", num[i]);

}

return 0;

}