Small Triangles Large Triangles HackerRank Solution

The code defines a structure for a triangle, with three integer sides. It then provides a function to sort an array of these triangle structures by their area. The area of each triangle is calculated using Heron's formula, and the array is sorted using a simple insertion sort algorithm.

Secure your next interview 🎯

CodeRankGPT is a tool powered by GPT-4 that quietly assists you during your coding interview, providing the solutions you need.
In real-time and absolutely undetectable 🥷

Here is the Small Triangles Large Triangles HackerRank Solution HackerRank solution using CodeRankGPT:

The solution first calculates the area of each triangle using Heron's formula, which is a mathematical formula used to find the area of a triangle when the lengths of all three sides are known. These areas are stored in an array. The code then sorts the array of triangles using an insertion sort algorithm, which is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.


#include 
#include 
#include 

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

typedef struct triangle triangle;


void sort_by_area(triangle* tr, int n) {

    float areas[n]; // array storing triangle areas
    double p, S; // for calculating arrays

    // Calculate triangle areas
    for (int i = 0; i < n; i++) {
        p = (tr[i].a + tr[i].b + tr[i].c) / 2.0;
        S = sqrt(p * (p - tr[i].a) * (p - tr[i].b) * (p - tr[i].c));
        // Add to the array
        areas[i] = S;
    }

    for (int i = 1; i < n; i++) {
        if (areas[i] < areas[i - 1]) {
            int j = i;
            // Swap values
            while (j > 0 && areas[j] < areas[j - 1]) {
                double temp = areas[j];
                triangle temp_tr = tr[j];

                areas[j] = areas[j - 1];
                tr[j] = tr[j - 1];

                areas[j - 1] = temp;
                tr[j - 1] = temp_tr;

                --j;
            }
        }
    }

}

int main()

If you have a HackerRank coding test coming up, you can use CodeRankGPT to your advantage. It will assist you during your interview and help ensure you get the job.

AI is here now, and other candidates might be using it to get ahead and win the job. 🧐

Submission Successful

The form has been successfully submitted.

Built on Unicorn Platform