Halstead complexity measures: Difference between revisions

Revision as of 15:48, 20 April 2021

Revision as of 07:22, 21 April 2021

Line 61:

* Number of delivered bugs: <math>B = { 2292.44 ^ { 2 \over 3 } \over 3000 } = 0.05</math>

== See also ==

int sort (int x[ ], int n)

* [[Function point]]

* [[Cyclomatic complexity]]

{

int i, j, save, im1;

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

If (n< 2) return 1;

for (i=2; i< =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;

}

==References==