Skip to main content
SpringerLink
Log in

Some aspects of sorting in two dimensions

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

The subject of this paper is two dimensional sorting. First we shall examine the problem of determining a lower bound on worst case time complexity of any two dimensional sorting algorithm, with regard to the definition of two dimensional sorting we are interested in. Then we shall design a sorting algorithm working on an information structure, such as to allow access to a record only through the adjacent ones. The algorithm has been implemented by computer, and we shall report the results obtained about time complexity, which turns out to be logarithic. While examining the above algorithm, we shall examine some special cases of two dimensional sorting.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliography

  1. D. E. Knuth,The art of computer programming, vol. 3 (1973). Addison-Wesley, Reading.

    Google Scholar 

  2. D. E. Knuth,Permutations, matrices and generalized Young tableaux, Pacific J. Math.34 (1970), 709–727.

    MATH  MathSciNet  Google Scholar 

  3. G. Morace,Un nuovo algoritmo ricorsivo di ordinamento. Tesi di specializzazione in Calcolo Automatico, Pisa 1975.

  4. E. Lodi, F. Luccio, C. Mugnai, L. Pagli,Studi preliminari sull’ordinamento in due dimensioni. Convegno AICA, Milano 1975.

    Google Scholar 

  5. A. V. Aho, J. E. Hopcroft, J. D. Ullman,The design and analysis of computer algorithms (1974), Addison-Wesley, Reading.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienze dell’Informazione, Università di Pisa, 56100, Pisa, Italy

    C. Ferretti

Authors
  1. C. Ferretti
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported by Comitato Nazionale per le Scienze Matematiche, C.N.R., under a scholarship for a thesis in computer science, and a research grant No. 75.01035.01.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferretti, C. Some aspects of sorting in two dimensions. Calcolo 15, 259–275 (1978). https://doi.org/10.1007/BF02575917

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02575917

Keywords

Search

Navigation