You are viewing a single comment's thread. Return to all comments →
**where am i goin wrong **
void sort_by_area(triangle* tr, int n) { int i,j,min_area_index; double *min_area,p,area; min_area=(double)malloc(sizeof(double)); area=(double*)malloc(sizeof(double)); triangle gr; *min_area=0.000000; for(i=0;imin_area=(double)(p(p-tr[i].a)(p-tr[i].b)(p-tr[i].c)); min_area_index=i; for(j=i+1;jarea=((double)(p(p-tr[j].a)(p-tr[j].b)(p-tr[j].c))); if(*area<*min_area) min_area_index=j; } gr=tr[i]; tr[i]=tr[min_area_index]; tr[min_area_index]=gr; }
}
Seems like cookies are disabled on this browser, please enable them to open this website
Small Triangles, Large Triangles
You are viewing a single comment's thread. Return to all comments →
**where am i goin wrong **
void sort_by_area(triangle* tr, int n) { int i,j,min_area_index; double *min_area,p,area; min_area=(double)malloc(sizeof(double)); area=(double*)malloc(sizeof(double)); triangle gr; *min_area=0.000000; for(i=0;imin_area=(double)(p(p-tr[i].a)(p-tr[i].b)(p-tr[i].c)); min_area_index=i; for(j=i+1;jarea=((double)(p(p-tr[j].a)(p-tr[j].b)(p-tr[j].c))); if(*area<*min_area) min_area_index=j;
} gr=tr[i]; tr[i]=tr[min_area_index]; tr[min_area_index]=gr; }
}