A model for set theoretic analysis of algorithm with asymtotic perspectives

It has sufficient scope to research in the area of complexity domain. In this paper, we proposed a novel model that is drawn to well understand asymtotic notations. In a novel model using a new Z-domain terminology is to easily analysis of asymtotic notations for set theoretic. Also, the impact of Θ (Sandwidtch or Cap theta) on transitivity and symmetry principal are analysis in the proposed model. It is also shown that algorithm performance needs to be examined for interval of n value as it does not depends only on significant terms of complexity function.