Over the years, researches have shown that fixed (constant) step-size methods have been efficient in integrating a stiff differential system. It has however been observed that for some stiff differential systems, non-fixed (variable) step-size methods are required for efficiency and for accuracy to be attained. This is because such systems have solution components that decay rapidly and/or slowly than others over a given integration interval. In order to curb this challenge, there is a need to propose a method that can vary the step size within a defined integration interval. This challenge motivated the development of Non-Fixed Step-Size Algorithm (NFSSA) using the Lagrange interpolation polynomial as a basis function via integration at selected limits. The NFSSA is capable of integrating highly stiff differential systems in both small and large intervals and is also efficient in terms of economy of computer time. The validation of properties of the proposed algorithm which include order, consistence, zero-stability, convergence, and region of absolute stability were further carried out. The algorithm was then applied to solve some samples mildly and highly stiff differential systems and the results generated were compared with those of some existing methods in terms of the total number of steps taken, number of function evaluation, number of failure/rejected steps, maximum errors, absolute errors, approximate solutions and execution time. The results obtained clearly showed that the NFSSA performed better than the existing ones with which we compared our results including the inbuilt MATLAB stiff solver, ode 15s. The results were also computationally reliable over long intervals and accurate on the abscissae points which they step on.
