DocumentCode
2658353
Title
A new Relative sort algorithm based on arithmetic mean value
Author
Butt, Wasi Haider ; Javed, Muhammad Younus
Author_Institution
Coll. of Electr. & Mech. Eng., Nat. Univ. of Sci. & Technol., Rawalpindi
fYear
2008
fDate
23-24 Dec. 2008
Firstpage
374
Lastpage
378
Abstract
In this article we propose a novel sorting algorithm based on comparing the arithmetic mean with each item in the list. Running cost analysis and results obtained after various implementations are also provided with the intention of comparing the efficiency of the proposed mechanism with other existing sorting methodologies.
Keywords
computational complexity; sorting; arithmetic mean value; computational complexity; relative sort algorithm; running cost analysis; Algorithm design and analysis; Arithmetic; Computational complexity; Computer science; Costs; Educational institutions; Mechanical engineering; Modems; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Multitopic Conference, 2008. INMIC 2008. IEEE International
Conference_Location
Karachi
Print_ISBN
978-1-4244-2823-6
Electronic_ISBN
978-1-4244-2824-3
Type
conf
DOI
10.1109/INMIC.2008.4777766
Filename
4777766
Link To Document