摘要
利用二叉树的结构性质 ,给出了一个基于二叉树的位排序算法 (BBS算法 ) .并证明了 BBS算法是生成二叉树的这组数据按排序码升序的排序 ,最后 ,我们讨论了该算法的算法复杂性 .
This paper gives a kind of algorithm of bit compositor based on the binary tree by using structural properties of bionary tree,and proves that the algorithm of BBS is compositor of sort ascending of the group of data which creation the binary tree in bit code.In the end,we discusses the complexity of the algorithm.\;
出处
《聊城师院学报（自然科学版）》
2000年第2期34-36,共3页
Journal of Liaocheng Teachers University(Natural Science Edition)
