An efficient non-recursive algorithm for computing the reliability of k-out-of-n systems

An algorithm for computing the reliability of k-out-of-n systems is proposed. It is simple, easy to implement on a computer, time and memory efficient, and good for numerical computation. The memory complexity is O(n-k), and for a given value of n-k the computation time is proportional to n. Its FORTRAN implementation is presented.<
>