‎Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures‎. ‎This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines‎, ‎including probability theory‎, ‎statistical physics‎, ‎computational biology and information theory‎. ‎With a careful combination of symbolic enumeration methods‎, ‎complex analysis‎, ‎generating functions and saddle point analysis‎, ‎it can be applied to study of fundamental structures such as permutations‎, ‎sequences‎, ‎strings‎, ‎walks‎, ‎paths‎, ‎trees‎, ‎graphs and maps‎. ‎This paper aims to introduce the order steps of an analytic combinatorics.