Articles

An algorithm is defined as a finite step-by-step procedure to accomplish a required result. It is also defined as a sequence of computational operations that convert the given input into the required output. In general, in the worst case, an algorithm is said to be optimal if there are no algorithms that perform a less basic number of well-defined operations, in the worst case. This paper presents an optimal algorithm for finding the second smallest among n numbers. The complexity of the proposed algorithm and its advantages are also analyzed in this paper.