Abstract
In this paper we tend to gift a algorithmic program, uses the methodology of assortment in insertion kind with efficiency to give a far better performance than the present sorting algorithms of the O(n2 ) category. We tend to prove the correctness of the algorithm, careful time quality analysis and applications of the algorithmic program.