The time complexities of previously published algorithms for circular consecutive-k-out-of-n:F systems are O (nk2) and O(nk). The authors propose a method to improve the original O(nk2 ) algorithm, and hence derive an O(nk) algorithm