而有项崭新的测试,能让研究人员透过快速排序电极和电解质的组合,以找出可以持续使用到车辆寿终正寝的电池(参见“更快捷的电动汽车电池测试”一文)。
And a new test could allow researchers to quickly sort through combinations of electrodes and electrolytes to find ones that will last for the life of a car (a Quicker test for EV Batteries).
但是它确实说明了创建一个能够快速排序的表非常简单,并且无需刷新页面,也不需要服务器来执行麻烦无聊的排序工作。
But it does demonstrate that it's easy to put together a table that sorts quickly, without a page refresh and without bothering the server to do the hard, uninteresting work of the sort.
但是由于很难在原地进行合并,所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..
好,二分查找的基本前提,或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表,我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
应用推荐