Halstead complexity measures: Difference between revisions

Revision as of 05:02, 26 August 2016

Revision as of 14:56, 10 September 2016

Line 32:

== Example ==

Let us consider the following C program:

<pre>

Line 59:

* Time required to program: <math>T = { 1,355.7 \over 18 } = 75.4</math> seconds

* Number of delivered bugs: <math>B = { 1,355.7 ^ { 2 \over 3 } \over 3000 } = 0.04</math>

==References==

<references />

== See also ==

* [[Function point]]

* [[Cyclomatic complexity]]

==References==

{{Reflist}}

==External links==

Line 71:

* [http://www.verifysoft.com/en_halstead_metrics.html Calculation of Halstead metrics] - Measurement of Halstead Metrics.

* [http://www.win.tue.nl/~aserebre/2IS55/2010-2011/10.pdf Explanation with a Sample Program] - Example (on Page 6 of the PDF)

* [httphttps://github.com/dborowiec/commentedCodeDetector Script computing Halstead Metrics and using them for commented code detection]

* [http://pic.dhe.ibm.com/infocenter/rtrthelp/v8r0m0/index.jsp?topic=%2Fcom.ibm.rational.testrt.studio.doc%2Ftopics%2Fcsmhalstead.htm IBM]

[[Category:Software metrics]]