Sorting real numbers on random access machines
This work describes a family, Segment-Sort, of algorithms for rapid sequential sorting of real numbers. Two computational models are discussed which correspond to the two main types of Segment-Sort algorithm: deterministic and random. With the deterministic model, the Basic RAM, it is possible to...
Main Author: | Blumenthal, Daniel S. |
---|---|
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/4328 |
Similar Items
-
Sorting real numbers on random access machines
by: Blumenthal, Daniel S.
Published: (2009) -
Highly sorted permutations and Bell numbers
by: Colin Defant
Published: (2020-12-01) -
The hospital as a sorting machine
by: Adam Pantanowitz, et al.
Published: (2021-01-01) -
Open access in Australia: an odyssey of sorts?
by: Colin Steele
Published: (2013-11-01) -
Using the Complete Sequences for Sorting Natural Numbers
by: Y. N. Artamonov
Published: (2017-12-01)