Advertisement

Wuhan University Journal of Natural Sciences

, Volume 2, Issue 3, pp 287–291 | Cite as

A new dynamic programming algorithm to workspiece sort problem

  • Xu Xusong
  • Liu Dacheng
  • Lu Jing
Article

Abstract

This paper provides a new dynamic programming algorithm for solving workpiese sort problem This algorithm sort set of n workpieces in the calculating time of O(n).

Key words

workpiece sort problem dynamic programming algorithm calculating time of O(n

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Editing and writing group of operations research.Oprations Research, Beijing: Tsinghua University press, 1988, 281–282Google Scholar
  2. 2.
    Horowltz E, Sahni S.Gundamentals of computer algorithm. London: Pitman publishing limited, 1979, 198–203Google Scholar
  3. 3.
    Xu Xusong.Introduction of data structure and algorithm. Beijing: Electronic industry press, 1996. 292–298Google Scholar
  4. 4.
    Xu Xusong, Zhou Jianqin Guo Feng. An only-once sorting algorthm. Wuhan: Wuhan University Journal of Natural Sciences, 1996,1(1):38–41MATHCrossRefGoogle Scholar

Copyright information

© Springer 1997

Authors and Affiliations

  • Xu Xusong
    • 1
  • Liu Dacheng
    • 1
  • Lu Jing
    • 1
  1. 1.School of ManagementWuhan UniversityWuhanChina

Personalised recommendations