首页   按字顺浏览 期刊浏览 卷期浏览 OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS

 

作者: LIN CHEN,  

 

期刊: Parallel Algorithms and Applications  （Taylor Available online 1997）
卷期: Volume 10, issue 3-4  

页码: 249-269

 

ISSN:1063-7192

 

年代: 1997

 

DOI:10.1080/10637199708915621

 

出版商: Taylor & Francis Group

 

关键词: bucket sorting;minimal interval and circular are overlap representations;oplimality;parallel algorithms

 

数据来源: Taylor

 

摘要:

In this paper, we investigate the problems of sorting integers by bucket sort and of computing minimal interval and circular are overlap representations, and give several optimal algorithms. We show that, givennlinearly ranged integers, sorting can be done

 

点击下载:  PDF (397KB)



返 回