摘要
提出了一种改进的计数排序算法。首先找到待排序记录应该存放的位置,然后在原数组空间上进行交换。与传统的计数排序算法相比,在不改变时间复杂度的同时,降低了空间复杂度,提高了算法性能。
An improved algorithm for counting sort is proposed, in which the storage position is located for the records to be sorted and then the records are exchanged in the position of the original number array. Compared with the traditional algorithm for counting sort,the complexity of space is lowered and the efficiency of algorithm is improved if the complexity of time remains unchanged.
出处
《渤海大学学报（自然科学版）》
CAS
2010年第2期174-176,共3页
Journal of Bohai University:Natural Science Edition
基金
辽宁省教育厅青年基金项目(20040022)
关键词
计数排序
时间复杂度
空间复杂度
counting sort
time complexity of time
complexity of space
