On Sorting an Intransitive Total Ordered Set Using Semi-Heap

1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering for any intransitive total ordered set. A new data structure called semi-heap is proposed to construct an optimal nlogn sorting algorithm. Finally, we propose a cost-optimal parallel algorithm using semi-heap. The run time of this algorithm is n with logn processors under the EREW PRAM model.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Jie Wu
• Keywords: Distributed And Parallel Computing, Intransitive Total, IPPS 2000, Sorting, Total Ordered Set