A new variant of in-place sort algorithm - Details

author：

Wang, X. (Wang, X..) ^[1] | Wu, Y. (Wu, Y..) ^[2] | Zhu, D. (Zhu, D..) ^[3]

Indexed by：

Scopus

Abstract：

This　paper　presents　a　new　variant　of　in　place　sort　algorithm,　n　improved　Heapsort　algorithm.　In　the　worst　case,　the　improved　algorithm　requires　nlogn+nlog*n+O(n)　comparisons　and　nlogn+O(n)　moves.　©　2011　Published　by　Elsevier　Ltd.

Keyword：

Algorithm; Complexity; Heap

Community：

[ 1 ] [Wang, X.]Quanzhou Normal University, Quanzhou 362000, China
[ 2 ] [Wang, X.]Fuzhou University, Fuzhou 350000, China
[ 3 ] [Wu, Y.]Fuzhou University, Fuzhou 350000, China
[ 4 ] [Zhu, D.]Quanzhou Normal University, Quanzhou 362000, China

Reprint 's Address：

[Wang, X.]Quanzhou Normal University, Quanzhou 362000, China

Email：

wangxd135@139.com

Show more details

Related Keywords：

Source ：

Procedia Engineering

ISSN： 1877-7058

Year： 2012

Volume： 29

Page： 2274-2278

Language： English

Cited Count：

WoS CC Cited Count： 0

SCOPUS Cited Count： 4

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 0

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to