Tạp chí Khoa học, T. 16, S. 6 (2019)

Cỡ chữ:  Nhỏ  Vừa  Lớn

An interesting discussion of running time for some sorting techniques without comparison sort

Phan Tan Quoc Quoc, Nguyen Quoc Huy

Tóm tắt

Sorting is one of important techniques for computer science as well as other technology areas; sorting is used mostly in searching, database management systems, scheduling, and computing algorithms. This paper aims to analyze the timing cost for some sorting techniques without comparison sorting such as Pigeonhole sort, Counting sort, Radix sort, and Bucket sort; these are sorting techniques with linear running time. Each technique is considered in running time, in-place, stable, and extra space if possible. The main contribution of the paper is experiments of sorting techniques in 90 large size test data. This is also a useful reference for working with sorting techniques.

Toàn văn: PDF

Tạp chí của Trường Đại học Sư phạm Thành phố Hồ Chí Minh ; ISSN: 1859 -3100