A new sort algorithm: self-indexed sort

Authors:
Sunny Y. Wang
Affiliations:
Computing Laboratory, Oxford University, Oxford OXl 3QD, UK
Venue:
ACM SIGPLAN Notices
Year:
1996

Citing 7
Cited 4

A one-way,stackless quisksort algorithm

BIT
Algorithms (2nd ed.)

Algorithms (2nd ed.)
Essays in computing science

Essays in computing science
Implementing Quicksort programs

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM
Computer Algorithms: Introduction to Design and Analysis

Computer Algorithms: Introduction to Design and Analysis
Data Structures with Abstract Data Types and Ada

Data Structures with Abstract Data Types and Ada

Comment on “self-indexed sort”

ACM SIGPLAN Notices
Parallel Self-Index Integer Sorting

The Journal of Supercomputing
Practical integer sorting on shared memory

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
The growing-tree sorting algorithm

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

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.