straight logic. NICE

nice ,simple and clear

That sqrt function was giving wrong values,thanks for pointing it out.

Its only working for Test case-0. What about the other ones ?

i had the exactly same logic but i had divided the sum of sides by 2 instead of 2.0 which resulted in only 2 right test cases

doubt here( float a=(tr[i].a+tr[i].b+tr[i].c)/2.0;) i tried taking a an int and dividing by 2 instead ........and it doesnt work why?

Wonderfully return!!!!!!!

how the temp is declared ,Can you explain me?

will this code work if we don't swap the areas.

why is it necessary to sort areas int temp=p[j]; p[j]=p[j+1]; p[j+1]=temp; if i remove these 3 lines from your prg it doesnt work...why???

But why did you allocated memory to p dynamically ?

some hidden test aRE fail ,, so cheack it ,,,,,;

Ooo...i missed that 2.0 (used 2)....that changed evertything

The 2.0 and the square root thing was really helpful.

I have a question! y u take float a,why it can't be int ? all the triange sides in structure triangle in int only.

when i am taking square root ,i am not getting it right . can any on help me?

while declaring p you set it as int insted of float. Was that intentional?

your code is good ... we can also define traingle t; varaiable n swap the entire structure at once instead of individual element;

beside changing traingle element one by one why don't you make a structure temp variable and use it swap structure in three lines??

Thanks man that sqrt() was consuming my 6 test cases.......

my code wrong answer for few testcases just coz i diidnt use 2.0 thanks for the suggestion mate

great logic bro . thanks

No one can manipulate!

Nice one. I just realized sqrt can be avoided. Thanks. You can also avoid the float altogether by changing the area formula to avoid dividing by 2; the result will be proportional to the area.

The formula will then be

int a=(tr[i].a+tr[i].b+tr[i].c);
//This is 16 times the square area of the triangle
p[i]=(a*(a-2*tr[i].a)*(a-2*tr[i].b)*(a-2*tr[i].c));

double sq(triangle * tr,int j){ float p=(tr[j].a+tr[j].b+tr[j].c)/2; return sqrt(p*(p-tr[j].a)(p-tr[j].b)(p-tr[j].c)); } void sort_by_area(triangle* tr, int n) { triangle *temp=malloc(n * sizeof(triangle));

for(int i=0;i<n-1;i++){
    for(int j=0;j<(n-1-i);j++){
        if(sq(tr,j)>sq(tr,(j+1))){
            temp[j]=tr[j];
            tr[j]=tr[j+1];
            tr[j+1]=temp[j];
                            }
                        }
                    }
                }

                First two passes for working good. Others did compile successfully, but returning wrongs answers at some points only. Where might be the error occured. 
                Is sqrt() is returning wrong values?? please do help
        }
    }
}

}

include

include

include

typedef struct rahul { int a; int b; int c;
} rahul; void bhai(rahul *t,int n) { float arr[n]; for(int i=0;i } for(int k=0;k } for(int i=0;iarr[j])
{ char temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; rahul tenp=t[i]; t[i]=t[j]; t[j]=tenp; }

}

} for(int k=0;k }
} int main() { int n; scanf("%d",&n); rahul r; r=(rahul)malloc(n*sizeof(rahul)); for(int i=0;i

} bhai(r,n);
}

why do we have to use the bubble sort why cant we use the normal sorting technique

While sorting Structure you don't need to sort every thing individually,just take 'temp' variable of structure type.

triangle temp; temp = tr[j]; tr[j] = tr[j+1]; tr[j+1] = temp;

''formula without sqrt as areas are different guarenteed'' I have not uderstand this.

is there any difference between array p being dynamic or static in this program.

I was trying to get correct output for 2-3 days but that 2 instead of 2.0 held me back. After reading your comment, as I changed it to 2.0, the exact output came. Now I understood the value of precise and accurate commenting. A smallest mistake, like I did, can hold you back getting the perfect results. Thanks for teaching me that ;)

Thank you, I did not know that sqrt does not work properly with float values.

Thanks, the sqrt makes my answers wrong.

Thanks a lot for giving that formula without sqrt.

thanks for the explanation....so happy

why can't we just swap triangle type objects tr[i] and tr[i+1].?

Thanks for this simple and concise explanation.

    This is how I did it by sorting array of areas ;)

    float area[n];
float s,temp;
int i,j;
for(int i=0;i<n;i++){
    s=(tr[i].a+tr[i].b+tr[i].c)/2.00;
    area[i]=sqrt(s*(s-tr[i].a)*(s-tr[i].b)*(s-tr[i].c));
    // printf("%f",area[i]);
}

for(i=0;i<n;i++){
    for(j=0;j<n-1-i;j++){
        if(area[j]>area[j+1]){
            temp=area[j+1];
            area[j+1]=area[j];
            area[j]=temp;
            //swapping elements of sides
            temp=tr[j+1].a;
            tr[j+1].a=tr[j].a;
            tr[j].a=temp;
            temp=tr[j+1].b;
            tr[j+1].b=tr[j].b;
            tr[j].b=temp;
            temp=tr[j+1].c;
            tr[j+1].c=tr[j].c;
            tr[j].c=temp;                
        }
    }
}

why did you sort area array?

*p should be float not integer. and the temp should also be float. sqrt works well.

You can just swap each structure mate, no need to swap each and every field between the 2 structures

I tried the same logic but its not working for other test cases except 1.

Thanks, It help me a lot.

instead of swapping each element of structure, you can swap only respective structure pointers: triangle temp; temp1=tr[j]; tr[j]=tr[j+1]; tr[j+1]=temp1;

You dont need to swap element wise. You can simply swap the traiangle by creting a separate temp variable of type struct triangle

During the sorting logic why can't we directly sort the length breadth and height without sorting the area array??It's showing test cases failed can you explain please??

Why do we have to sort areas also? Initially I was sorting only traingles based on their areas so the output was incorrect.