Abstract
Algorithms help in solving many problems, where other mathematical solutions are very complex or impossible. In this paper edge irregularity strength of a complete graph es(K-n) is computed using the algorithm that is impossible to compute manually on higher order graphs. Using the values of es(K-n) an upper-bound is suggested that is far better than previous upper bound F-n.