Khamitka, Santosh and Bhalchandra, Parag and Lokhande, Sakharam and Deshmukh, Nilesh (2009) The Folklore of Sorting Algorithms. [Journal (Paginated)]
Full text available as:
![[img]](../style/images/fileicons/application_pdf.png)
Abstract
The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine sorting algorithms in the folklore lines and try to discover the tradeoffs between folklore and theorems. Finally, the folklore knowledge on complexity values of the sorting algorithms will be considered, verified and subsequently converged in to theorems.
| Item Type: | Journal (Paginated) |
|---|---|
| Keywords: | Folklore, Algorithm analysis, Sorting algorithm, Computational Complexity notations |
| Subjects: | Computer Science > Complexity Theory |
| ID Code: | 6714 |
| Deposited By: | International Journal of Computer Science Issues, IJCSI |
| Deposited On: | 14 Nov 2009 11:30 |
| Last Modified: | 11 Mar 2011 08:57 |
Metadata
- ASCII Citation
- Atom
- BibTeX
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- MPEG-21 DIDL
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page
