Algorithms Complexity and Line Clipping Problem Solutions

Abstract

Algorithm complexity is very often used for comparison of different algorithms in order to assess theirs properties. Nevertheless there are some other factors like actual speed for the expected applications, memory needed and others that might influence the final behaviour of the proposed algorithm. The aim of this contribution is to demonstrate some thoughts and connection between algorithm complexity, speed and discuss the influence of possible pre-processing to the final algorithm complexity. It will be also shown how some precise formulations could lead to better and faster algorithms to decrease algorithm complexity. The influence of pre-processing will be analysed according to the algorithm complexity change.