Skip to main content

Function XSSORT

  • Chapter
  • First Online:
  • 143 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 187))

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

7 — References

  • BOISGONTIER Jacques & BOUTELOUP Guilhem Savoir bien trier: Comment gagner du temps L'Ordinateur Individuel, No. 33, 12/1981, pp. 147–150

    Google Scholar 

  • SHELL D. L. A Highspeed Sorting Procedure Comm. ACM, Vol. 2, No. 7, 1959, pp. 30–32

    Article  Google Scholar 

  • KNUTH Donald E. The Art of Computer Programming Vol. 3, Addison-Wesley, Reading, 1973.

    Google Scholar 

Download references

Editor information

François S. Chaghaghi

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1985). Function XSSORT. In: Chaghaghi, F.S. (eds) Time Series Package (TSPACK). Lecture Notes in Computer Science, vol 187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15202-4_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-15202-4_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15202-6

  • Online ISBN: 978-3-540-39314-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics