A computer program is an implementation of an algorithm considered to be a collection of tokens which can be classified as either operators or operands. **Halstead’s metrics** are included in a number of current commercial tools that count software lines of code. By counting the tokens and determining which are operators and which are operands, the following base measures can be collected :

n1 = Number of distinct operators.

n2 = Number of distinct operands.

N1 = Total number of occurrences of operators.

N2 = Total number of occurrences of operands.

In addition to the above, Halstead defines the following :

n1* = Number of potential operators.

n2* = Number of potential operands.

Halstead refers to n1* and n2* as the minimum possible number of operators and operands for a module and a program respectively. This minimum number would be embodied in the programming language itself, in which the required operation would already exist (for example, in C language, any program must contain at least the definition of the function main()), possibly as a function or as a procedure: n1* = 2, since at least 2 operators must appear for any function or procedure : 1 for the name of the function and 1 to serve as an assignment or grouping symbol, and n2* represents the number of parameters, without repetition, which would need to be passed on to the function or the procedure.

### Halstead metrics –

Halstead metrics are :

**Halstead Program Length –**The total number of operator occurrences and the total number of operand occurrences.

N = N1 + N2And estimated program length is, N

^{^}= n1log_{2}n1 + n2log_{2}n2The following alternate expressions have been published to estimate program length:

- N
_{J}= log_{2}(n1!) + log_{2}(n2!) - N
_{B}= n1 * log_{2}n2 + n2 * log_{2}n1 - N
_{C}= n1 * sqrt(n1) + n2 * sqrt(n2) - N
_{S}= (n * log_{2}n) / 2

- N
**Halstead Vocabulary –**The total number of unique operator and unique operand occurrences.

n = n1 + n2**Program Volume –**Proportional to program size, represents the size, in bits, of space necessary for storing the program. This parameter is dependent on specific algorithm implementation. The properties V, N, and the number of lines in the code are shown to be linearly connected and equally valid for measuring relative program size.V = Size * (log

_{2}vocabulary) = N * log_{2}(n)The unit of measurement of volume is the common unit for size “bits”. It is the actual size of a program if a uniform binary encoding for the vocabulary is used. And error = Volume / 3000

**Potential Minimum Volume –**The potential minimum volume V* is defined as the volume of the most succinct program in which a problem can be coded.V* = (2 + n2*) * log

_{2}(2 + n2*)Here, n2* is the count of unique input and output parameters

**Program Level –**To rank the programming languages, the level of abstraction provided by the programming language, Program Level (L) is considered. The higher the level of a language, the less effort it takes to develop a program using that language.L = V* / V

The value of L ranges between zero and one, with L=1 representing a program written at the highest possible level (i.e., with minimum size).

And estimated program level is L^{^}=2 * (n2) / (n1)(N2)**Program Difficulty –**This parameter shows how difficult to handle the program is.

D = (n1 / 2) * (N2 / n2)

D = 1 / L

As the volume of the implementation of a program increases, the program level decreases and the difficulty increases. Thus, programming practices such as redundant usage of operands, or the failure to use higher-level control constructs will tend to increase the volume as well as the difficulty.**Programming Effort –**Measures the amount of mental activity needed to translate the existing algorithm into implementation in the specified program language.

E = V / L = D * V = Difficulty * Volume

**Language Level –**Shows the algorithm implementation program language level. The same algorithm demands additional effort if it is written in a low-level program language. For example, it is easier to program in Pascal than in Assembler.

L’ = V / D / D

lambda = L * V* = L^{2}* V**Intelligence Content –**Determines the amount of intelligence presented (stated) in the program This parameter provides a measurement of program complexity, independently of the program language in which it was implemented.

I = V / D**Programming Time –**Shows time (in minutes) needed to translate the existing algorithm into implementation in the specified program language.

T = E / (f * S)The concept of the processing rate of the human brain, developed by the psychologist John Stroud, is also used. Stoud defined a moment as the time required by the human brain requires to carry out the most elementary decision. The Stoud number S is therefore Stoud’s moments per second with:

5 <= S <= 20. Halstead uses 18. The value of S has been empirically developed from psychological reasoning, and its recommended value for programming applications is 18.Stroud number S = 18 moments / second

seconds-to-minutes factor f = 60

### Counting rules for C language –

- Comments are not considered.
- The identifier and function declarations are not considered
- All the variables and constants are considered operands.
- Global variables used in different modules of the same program are counted as multiple occurrences of the same variable.
- Local variables with the same name in different functions are counted as unique operands.
- Functions calls are considered as operators.
- All looping statements e.g., do {…} while ( ), while ( ) {…}, for ( ) {…}, all control statements e.g., if ( ) {…}, if ( ) {…} else {…}, etc. are considered as operators.
- In control construct switch ( ) {case:…}, switch as well as all the case statements are considered as operators.
- The reserve words like return, default, continue, break, sizeof, etc., are considered as operators.
- All the brackets, commas, and terminators are considered as operators.
- GOTO is counted as an operator and the label is counted as an operand.
- The unary and binary occurrence of “+” and “-” are dealt separately. Similarly “*” (multiplication operator) are dealt separately.
- In the array variables such as “array-name [index]” “array-name” and “index” are considered as operands and [ ] is considered as operator.
- In the structure variables such as “struct-name, member-name” or “struct-name -> member-name”, struct-name, member-name are taken as operands and ‘.’, ‘->’ are taken as operators. Some names of member elements in different structure variables are counted as unique operands.
- All the hash directive are ignored.

**Example –** List out the operators and operands and also calculate the values of software science measures like

int sort (int x[ ], int n) { 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; }

**Explanation –**

operators | occurrences | operands | occurrences |

int | 4 | sort | 1 |

() | 5 | x | 7 |

, | 4 | n | 3 |

[] | 7 | i | 8 |

if | 2 | j | 7 |

< | 2 | save | 3 |

; | 11 | im1 | 3 |

for | 2 | 2 | 2 |

= | 6 | 1 | 3 |

– | 1 | 0 | 1 |

<= | 2 | – | – |

++ | 2 | – | – |

return | 2 | – | – |

{} | 3 | – | – |

n1=14 | N1=53 | n2=10 | N2=38 |

Therefore, N = 91 n = 24 V = 417.23 bits N^ = 86.51 n2* = 3 (x:array holding integer to be sorted. This is used both as input and output) V* = 11.6 L = 0.027 D = 37.03 L^ = 0.038 T = 610 seconds

**Advantages of Halstead Metrics:**

- It is simple to calculate.
- It measures overall quality of the programs.
- It predicts the rate of error.
- It predicts maintenance effort.
- It does not require the full analysis of programming structure.
- It is useful in scheduling and reporting projects.
- It can be used for any programming language.

### Disadvantages of Halstead Metrics:

- It depends on the complete code.
- It has no use as a predictive estimating model.

**Reference –**

Halstead complexity measures – Wikipedia

ristancase

This article is contributed by **Shivani Virmani**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the **CS Theory Course** at a student-friendly price and become industry ready.