A new sort algorithm: Self-indexed sort (1996)
by
Yingxu Wang
| Venue: | ACM SIGPLAN Notices |
| Citations: | 1 - 0 self |
BibTeX
@ARTICLE{Wang96anew,
author = {Yingxu Wang},
title = {A new sort algorithm: Self-indexed sort},
journal = {ACM SIGPLAN Notices},
year = {1996},
volume = {31}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT: This paper presents a new sort algorithm, self-indexed sort (SIS), on an approach of non compare-based sorting. Results on time complexity O(n) and space complexity O(n+m) are achieved, where n is the size of data being sorted and m is the size of the sorting space. Two versions of SIS sort algorithm are implemented with one for the sort of structured records and the other for pure data file. The performance of SIS sort is tested and analysed under various conditions.
Citations
| 140 | Algorithm 232: heapsort - Williams - 1964 |
| 129 | Computer Algorithms: Introduction to Design and Analysis - Baase - 1978 |
| 81 | Implementing quicksort Programs - Sedgewick - 1978 |
| 49 | Algorithm 64: Quicksort - Hoare - 1961 |
| 40 | Quicksort - Hoare - 1962 |
| 16 | Data Structures With Abstract Data Types and Pascal - Stubbs, Webre - 1989 |
| 14 | Algorithms. 2nd ed - Sedgewick - 1987 |
| 9 | Theory and practice in the construction of a working sort routine - Linderman - 1984 |
| 3 | The Art of Computer Programming - Kunth - 1973 |
| 3 | A one-way, stackless quicksort algorithm - Huang, Knuth - 1986 |
| 1 | On the Design of Self-Indexed Sorting Algorithm - Wang - 1995 |
