Halstead complexity measures: Difference between revisions

Revision as of 07:22, 21 April 2021

Revision as of 05:07, 5 June 2021

Line 36:

<syntaxhighlight lang="c">

int sort (int x[ ], int n)

main()

{

int ai, bj, csave, avgim1;

/*This function sorts array x in ascending order */

scanf("%d %d %d", &a, &b, &c);

avg =If (a + b +n< c2) /return 31;

printf("avgfor (i=2; %d",i< avg)=n; i++)

{

}

im1=i-1;

for (j=1; j< =im1; j++)

if (x[i] < x[j])

{

Save = x[i];

x[i] = x[j];

x[j] = save;

}

}

return 0;

}

</syntaxhighlight>