This paper presents the time complexity analysis of the Binary Tree Roll algorithm. The time complexity is analyzed theoretically and the results are then confirmed empirically. The theoretical analysis consists of finding recurrence relations for the time complexity, and solving them using various methods. The empirical analysis consists of exhaustively testing all trees with given numbers of nodes and counting the minimum and maximum steps necessary to complete the roll algorithm. The time complexity is shown, both theoretically and empirically, to be linear in the best case and quadratic in the worst case, whereas its average case is shown to be dominantly linear for trees with a relatively small number of nodes and dominantly quadratic otherwise.
The availability of real-time data on the state of railway facilities and the state-of-the art technologies for data collection and analysis allow transition to the fourth generation maintenance. It is based on the prediction of the facility functional safety and dependability and the risk-oriented facility management. The article describes an approach to assessing the risks of hazardous facility failures using the latest digital data processing methods. The implementation of this approach will help set maintenance objectives and contribute to the efficient use of resources and the reduction of railway facility managers’ expenditures.
The availability of real-time data on the state of railway facilities and the state-of-the art technologies for data collection and analysis allow transition to the fourth generation maintenance. It is based on the prediction of the facility functional safety and dependability and the risk-oriented facility management. The article describes an approach to assessing the risks of hazardous facility failures using the latest digital data processing methods. The implementation of this approach will help set maintenance objectives and contribute to the efficient use of resources and the reduction of railway facility managers’ expenditures.
