Small Triangles, Large Triangles in c - Hacker Rank Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

struct triangle
{
 int a;
 int b;
 int c;
};

typedef struct triangle triangle;
void sort_by_area(triangle* tr, int n) 
{
  int *p=malloc(n*sizeof(float)); 
//create array of size n to store "volumes"
    for(int i=0;i<n;i++)
    {
 float a=(tr[i].a+tr[i].b+tr[i].c)/2.0;
//use 2.0 compulsary int/int gives int, int/float gives float
       p[i]=(a*(a-tr[i].a)*(a-tr[i].b)*(a-tr[i].c));
//formula without sqrt as areas are different guarenteed 
//because sqrt dosent work well with float values
    }
//bubble sort
    for(int i=0;i<n;i++)    
    {
        for(int j=0;j<n-i-1;j++)
        {
            if(p[j]>p[j+1])     
            {
                int temp=p[j];
                p[j]=p[j+1];
                p[j+1]=temp;
//swapping array of areas in ascending
//and simuntaneously the structure contents
                temp=tr[j].a;
                tr[j].a=tr[j+1].a;
                tr[j+1].a=temp;
                temp=tr[j].b;
                tr[j].b=tr[j+1].b;
                tr[j+1].b=temp;
                temp=tr[j].c;
                tr[j].c=tr[j+1].c;
                tr[j+1].c=temp;
            }
        }
    }
}

int main()
{
 int n;
 scanf("%d", &n);
 triangle *tr = malloc(n * sizeof(triangle));
 for (int i = 0; i < n; i++) {
  scanf("%d%d%d", &tr[i].a, &tr[i].b, &tr[i].c);
 }
 sort_by_area(tr, n);
 for (int i = 0; i < n; i++) 
 {
  printf("%d %d %d\n", tr[i].a, tr[i].b, tr[i].c);
 }
 return 0;
}