pith. sign in

arxiv: 1107.4223 · v1 · pith:KG4L2TI5new · submitted 2011-07-21 · 💻 cs.DS

Sorting Algorithms with Restrictions

classification 💻 cs.DS
keywords sortingdataalgorithmicalgorithmsappearanceappliedarchivedbelow
0
0 comments X
read the original abstract

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.