This paper describes a procedure for estimating the number of iterations in the main loop of a recently proposed algorithm designed to detect helical charged particle tracks in detectors submerged in a magnetic field. The calculations are based on a Monte Carlo simulation of the ATLAS inner detector. The resulting estimates of numerical complexity suggest that using the new procedure for online triggering is not feasible. There are however some areas, such as triggering for particles in a specific sub-domain of the phase space, where using this procedure might be beneficial.