高分求计算机英语翻译.急！！！！！

来源：百度知道 编辑：UC知道 时间：2024/05/16 16:13:05
TYPICAL SORT PROBLEMS
Treesort
Treesort is a tow-step.Fist,the elements are inserted inserted into abinary search tree .Second,the elements are retrieved,in sorted order,using an inorder traversal.
A binary search tree is not an attractive aooroach to sorting because a heap does the same job with less effort.Tnstead of starting out by putting the elements in binary search tree, we begin by forming a heap.If,however,the elements are in a binary search tree,then aninorder traversal accesses them in sorted order withO(n) effort.
Mergesort
Two sublists,each already sorted,can bemerged together to form one aggregate list that is also sorted.Asimple and effective procedure for doing this,called mergesort,begins by comparing pairs of elements-one from each sublist.The smallest element is appended to a sorted list and is replaced by the next element from its sublist.The smallest element is appended to asorted list and is replaced by the next element from its subli

TYPICAL SORT PROBLEMS
典型排序问题
Treesort 树排序
Treesort is a tow-step.Fist,the elements are inserted inserted into a binary search tree .Second,the elements are retrieved,in sorted order,using an inorder traversal.
A binary search tree is not an attractive aooroach to sorting because a heap does the same job with less effort.Tnstead of starting out by putting the elements in binary search tree, we begin by forming a heap.If,however,the elements are in a binary search tree,then aninorder traversal accesses them in sorted order withO(n) effort.
树排序是一种落后的方法。首先，其中的元素被嵌入一个二叉搜索树。其次，其中的元素又必须依次使用中序遍历来进行。而对于相同的工作量，堆排序消耗的资源比二叉树排序消耗的少得多。因此开始的时候，我们将元素构建一个堆而不是将其放入二叉树。尽管如此，如果元素已经在一个二叉树里了，那么花点功夫使用中序遍历将其排好序（withO(n) effort有可能是你打错了，我不清楚...）
Mergesort 归并排序
Two sublists,each already sorted,can bemerged together to form one aggregate list that is also sorted.Asimple and effective procedure for doing this,called mergesort,begins by comparing pairs of elements-one from ea