Skip to main content
Log in

Two methods of sorting elements in data files

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. A. T. Berztiss, Data Structures: Theory and Practice, Academic Press (1971).

  2. V. M. Glushkov, V. P. Gladun, et al., Processing Data Files in Automated Management Systems [in Russian], Naukova Dumka, Kiev (1970).

    Google Scholar 

  3. É. I. Alferova and M. A. Volovich, Sorting Data by Electronic Computers [in Russian], Statistika, Moscow (1965).

    Google Scholar 

  4. A. M. Yaglom and I. M. Yaglom, Probability and Information [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  5. H. Steinhaus, One Hundred Problems [Russian translation], Fizmatgiz, Moscow (1959).

    Google Scholar 

  6. S. N. Seletkov and B. G. Volkov, Data Storage and Retrieval by Computer. The Organization and Retrieval of Data in Information-Logical Systems [in Russian], Sov. Radio, Moscow (1971).

    Google Scholar 

  7. A. A. Papernov and G. V. Stasevich, “A method for ordering information in digital machine storage,” Probl. Peredachi Inform.,1, No. 3 (1965).

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 17–21, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabello, E.P. Two methods of sorting elements in data files. Cybern Syst Anal 13, 161–166 (1977). https://doi.org/10.1007/BF01073303

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation