unsorted

The sequence`` AACEDGG''has only one inversion ( E and D) it is nearly sorted while the sequence`` ZWQM''has6 inversions ( it is as unsorted as can be exactly the reverse of sorted).

序列“AACEDGG”逆序数为1（E与D）&近似排序，而序列``ZWQM''逆序数为6（它是已排序序列的反序）。

In principle, it can exploit coherent quantum interference and entanglement to perform computations, such as factoring large numbers or searching an unsorted database, more rapidly than classical computers.

原则上，它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2]。

The problem of searching for a specific item in an unsorted database can be solved with certain quantum algorithm, for example, Grover quantum algorithm and Br ü schweiler quantum algorithm.

对于在无序数据库中进行搜索这类问题，可以用量子算法，如Br櫣schweiler量子搜索算法来解决。