数学物理学报(英文版) ›› 1998, Vol. 18 ›› Issue (4): 421-426.

• 论文 • 上一篇    下一篇

A FAST TREE SOREING ALGORITHM

黄竞伟1, 戴大为2   

  1. 1. State Key Lab. of Software Engineering. Wuhan University, Wuhan 430072, China;
    2. Department of Computer Science, Wuhan University, Wuhan 430072, China
  • 收稿日期:1997-12-26 出版日期:1998-12-25 发布日期:1998-12-25
  • 基金资助:
    This work was supported by the National Science Foundation

A FAST TREE SOREING ALGORITHM

Huang Jingwei1, Dai Dawei2   

  1. 1. State Key Lab. of Software Engineering. Wuhan University, Wuhan 430072, China;
    2. Department of Computer Science, Wuhan University, Wuhan 430072, China
  • Received:1997-12-26 Online:1998-12-25 Published:1998-12-25
  • Supported by:
    This work was supported by the National Science Foundation

摘要: This paper presents a new tree sorting algorithm whose average time complexity is much better than the sorting methods using AVL-Tree or other balanced trees. The experiment shows that our algorithm is much faster than the sorting methods using AVL-Thee or other balanced trees.

关键词: Sorting, algorithm, time complexity

Abstract: This paper presents a new tree sorting algorithm whose average time complexity is much better than the sorting methods using AVL-Tree or other balanced trees. The experiment shows that our algorithm is much faster than the sorting methods using AVL-Thee or other balanced trees.

Key words: Sorting, algorithm, time complexity