C || short solution
Solution should be fairly self explanatory, just sort the array and then check each triplet for the triangle inequality (a+b > c).\n\n\nint* comp(const void* a,
Solution should be fairly self explanatory, just sort the array and then check each triplet for the triangle inequality (`a+b > c`).\n\n```\nint* comp(const void* a, const void* b){\n    return (*(int*)a - *(int*)b);\n}\n\nint largestPerimeter(int* nums, int numsSize){\n    qsort(nums, numsSize, sizeof(int), comp);\n    int cur=0;\n    for (int i=2; i<numsSize; i++)\n        if (nums[i] < nums[i-1] + nums[i-2])\n            cur = nums[i] + nums[i-1] + nums[i-2];\n    \n    return cur;\n}\n```
['C', 'Sorting']