A Sorting Algorithm Based on Calculation

Simple item page
dc.creatorBao, Sheng
dc.creatorZheng, De-Shun
dc.date2005-08-29
dc.date.accessioned2026-07-07T03:23:24Z
dc.date.available2026-07-07T03:23:24Z
dc.descriptionThis article introduces an adaptive sorting algorithm that can relocate elements accurately by substituting their values into a function which we name it the guessing function. We focus on building this function which is the mapping relationship between record values and their corresponding sorted locations essentially. The time complexity of this algorithm O(n),when records distributed uniformly. Additionally, similar approach can be used in the searching algorithm.
dc.identifierhttps://arxiv.org/abs/cs/0508125
dc.identifierhttp://arxiv.org/abs/cs/0508125
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32925
dc.subjectData Structures and Algorithms
dc.titleA Sorting Algorithm Based on Calculation
dc.typetext

Files

Collections

arXiv