An Optimized Input Sorting Algorithm

1
Anshu Mishra
Anshu Mishra
2
Garima Goyal
Garima Goyal
1 to 2 Jyothy Institute of Technology/ Visvervaraya Technological University

Send Message

To: Author

GJCST Volume 16 Issue H1

Article Fingerprint

ReserarchID

CSTITC4SRK

An Optimized Input Sorting Algorithm Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

One of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising.

6 Cites in Articles

References

  1. D Knuth (1998). The Art Of Computer Programming.
  2. B Shahzad,M Afzal (2007). Enhanched Shell Sorting Algorithm.
  3. T Cormen,C Leisersion,R Rivest,C Stein (2001). Introduction to Algorithms.
  4. A Aho,J Hopcroft,Ullman (1974). the design and analysis of computer Algorithms.
  5. M Thoroup (2002). Randomized Sorting in O(n log log n) Time And Linear Space Addition, Shift, and Bit Wise Boolean Operations.
  6. O Astrachanm (2003). Bubble Sort: An Archaeological Algorithmic Analysis.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Anshu Mishra. 2016. \u201cAn Optimized Input Sorting Algorithm\u201d. Global Journal of Computer Science and Technology - H: Information & Technology GJCST-H Volume 16 (GJCST Volume 16 Issue H1): .

Download Citation

Issue Cover
GJCST Volume 16 Issue H1
Pg. 11- 13
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
F.2.2
Version of record

v1.2

Issue date

March 4, 2016

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 7474
Total Downloads: 2045
2026 Trends
Research Identity (RIN)
Related Research

Published Article

One of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Optimized Input Sorting Algorithm

Anshu Mishra
Anshu Mishra Jyothy Institute of Technology/ Visvervaraya Technological University
Garima Goyal
Garima Goyal Jyothy Institute of Technology/ Visvervaraya Technological University

Research Journals