Science Publications

Sign Up
Sign In
Submit
Current Research in Public Health
Cite This Article Share Download PDF XML
  1. Home
  2. Journals
  3. Current Research in Public Health
  4. Archive
  5. Volume 1, Issue 1, 2022
  6. Article
Article Open Access May 01, 2022

A Linear-Time Algorithm to Find the Second Smallest Number

Raja Marappan 1,* and S. Bhaskaran 1
1
School of Computing, SASTRA Deemed University, Thanjavur, India
Publihed in: Current Research in Public Health (Volume 1, Issue 1, 2022)
Page(s): 8-11
DOI: 10.31586/ijmebac.2022.285
Received
March 22, 2022
Revised
April 21, 2022
Accepted
April 29, 2022
Published
May 01, 2022
Keywords
Algorithm; Computational Complexity; Optimal Algorithm; Second Smallest; Searching Smallest
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright: Copyright © The Author(s), 2022. Published by Scientific Publications
Article metrics
Views
396
Downloads
133

Cite This Article

APA Style
Marappan, R. , & Bhaskaran, S. (2022). A Linear-Time Algorithm to Find the Second Smallest Number. Current Research in Public Health, 1(1), 8-11. https://doi.org/10.31586/ijmebac.2022.285
ACS Style
Marappan, R. ; Bhaskaran, S. A Linear-Time Algorithm to Find the Second Smallest Number. Current Research in Public Health 2022 1(1), 8-11. https://doi.org/10.31586/ijmebac.2022.285
Chicago/Turabian Style
Marappan, Raja, and S. Bhaskaran. 2022. "A Linear-Time Algorithm to Find the Second Smallest Number". Current Research in Public Health 1, no. 1: 8-11. https://doi.org/10.31586/ijmebac.2022.285
AMA Style
Marappan R, Bhaskaran S. A Linear-Time Algorithm to Find the Second Smallest Number. Current Research in Public Health. 2022; 1(1):8-11. https://doi.org/10.31586/ijmebac.2022.285 
@Article{crph285,
AUTHOR = {Marappan, Raja and Bhaskaran, S.},
TITLE = {A Linear-Time Algorithm to Find the Second Smallest Number},
JOURNAL = {Current Research in Public Health},
VOLUME = {1},
YEAR = {2022},
NUMBER = {1},
PAGES = {8-11},
URL = {https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/285},
ISSN = {2831-5162},
DOI = {10.31586/ijmebac.2022.285},
ABSTRACT = {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.},
}
%0 Journal Article
%A Marappan, Raja
%A Bhaskaran, S.
%D 2022
%J Current Research in Public Health

%@ 2831-5162
%V 1
%N 1
%P 8-11

%T A Linear-Time Algorithm to Find the Second Smallest Number
%M doi:10.31586/ijmebac.2022.285
%U https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/285

TY  - JOUR
AU  - Marappan, Raja
AU  - Bhaskaran, S.
TI  - A Linear-Time Algorithm to Find the Second Smallest Number
T2  - Current Research in Public Health
PY  - 2022
VL  - 1
IS  - 1
SN  - 2831-5162
SP  - 8
EP  - 11
UR  - https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/285
AB  - 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.
DO  - A Linear-Time Algorithm to Find the Second Smallest Number
TI  - 10.31586/ijmebac.2022.285
ER  -