Given the following algorithm for sorting an array X and N numbers:
SUBROUTINE SHORT (X, N)
IF (N < 2)
RETURN
FOR (i = 2) TO N INCREMENT BY 1)
FOR (j = 1) TO i INCREMENT BY 1)
IF (X [i] > X [j])
CONTINUE
TEMP = X[i]
X[i] = X[j]
X[j] = TEMP
END FOR
END SUBROUTINE
A good approximation of Halstead`s estimated program length is
- 20
- 50
- 80
- 110