Loading menu…

Enhanced Novel Sorting Algorithm

Rayudu Srinivas
Rayudu Srinivas * Β§ B.Tech.,M.Tech., (Ph.D)
Β§ Surampalem

Send Message

To: Author

Enhanced Novel Sorting Algorithm

Article Fingerprint

ReserarchID

CSTM8544

Enhanced Novel Sorting Algorithm Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • 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
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

In computer science and mathematics; we can formulate a procedure for sorting unordered array or a file. Such procedure is always governed by an algorithm; which is called as Sorting Algorithm. Sorting is generally understood to be the process of rearranging a given set of objects in a specific order. The purpose of sorting is to facilitate the later search for members of the sorted set.

References

13 Cites in Article
  1. 1. Krung Sinapiromsaran (2005). The sorted list exhibits the minimum successive difference. The Joint Conference on Computer Science and Software Engineering
  2. 2. D Malik (2002). C++ Programming: Program Design Including Data Structures.
  3. 3. T Cormen,C Leiserson,R Rivest,C Stein (2001). Introduction to Algorithms. Introduction to Algorithms
  4. 4. C Liu (1971). Analysis of sorting algorithms. Proceedings of Switching and Automata Theory, 12th Annual Symposium, 207-215.
  5. 5. J Francesc,Ferri (1996). 3.6 Sometimes Remate with Another Male. Female Control, 20, 111-119.
  6. 6. Parag Bhalchandra,*,Nilesh Deshmukh,Sakharam Lokhande,Santosh Phulari (2009). A Comprehensive Note on Complexity Issues in Sorting Algorithms. Advances in Computational Research, 1(2), 1-09.
  7. 7. Omar Khan Durrani,V Shreelakshmi,Sushma Shetty,& Vinutha,D Analysis and Determination of Asymptotic Behavior Range For Popular Sorting Algorithms. Special Issue of International Journal of Computer Science & Informatics (IJCSI), II, 2231-5292.
  8. 8. Owen Astrachan (2003). Bubble sort. Proceedings of the 34th SIGCSE technical symposium on Computer science education - SIGCSE '03
  9. 9. Vladmir Estivill-Castro,Derick Wood (1992). A survey of adaptive sorting algorithms. ACM Computing Surveys, 24(4), 441-476.
  10. 10. Vladmir Estivill-Castro,Derick Wood (1992). A survey of adaptive sorting algorithms. ACM Computing Surveys, 24(4), 441-476.
  11. 11. Jan Hoffmann,Martin Hofmann (2010). Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics. Lecture Notes in Computer Science, 172-187.
  12. 12. Nadathur Satish,Mark Harris,Michael Garland (2009). Designing Efficient Sorting Algorithms for Manycore GPUs. 23rd IEEE International Parallel and Distributed Processing Symposium
  13. 13. Soubhik Chakraborty,Mausumi Bose,Kumar Sushant (2021). Why we need more inclusive research. Why we need more inclusive research

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.

How to Cite This Article

R.Srinivas. 2013. "Enhanced Novel Sorting Algorithm". Global Journal of Computer Science and Technology GJCST-C Volume 13 (GJCST Volume 13 Issue C11).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification E.5
Version of record
v1.2

Issue date
November 5, 2013

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2.1K
Total Downloads: 148
All Trends

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

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.

Enhanced Novel Sorting Algorithm

R.Srinivas
R.Srinivas Surampalem