Here you're moving around blocks of code to create an insertion sort algorithm.

在这里，你需要移动代码块来创建插入排序算法。

But, a sorting algorithm isn't a program; it's likely only a small part of a much larger program.

但是，排序算法不是程序；它是程序。它可能只是一个更大程序的一小部分。

So, you might ask, as a burgeoning computer scientist, is there a more efficient sorting algorithm?

那么，作为一名新兴的计算机科学家，您可能会问，是否有更高效的排序算法？

So, if you're tasked with writing a sort algorithm, you only need to make sure it sorts properly and efficiently.

因此，如果您的任务是编写排序算法，您只需要确保它正确有效地排序即可。

This relationship of input size to the number of steps the algorithm takes to run characterizes the complexity of the Selection Sort algorithm.

输入大小与算法运行的步数之间的这种关系表征了选择排序算法的复杂性。

There are literally dozens of sorting algorithms we could review, but instead, I want to move on to my other favorite category of classic algorithmic problems: graph search!

我们可以查看几十种排序算法，但相反，我想继续讨论我最喜欢的另一类经典算法问题：图搜索！

The most straightforward way to handle this is to use a sort algorithm, and arrange all the polygons in the scene from farthest to nearest, then render them in that order.

处理这个问题最直接的方法是使用排序算法，将场景中的所有多边形从远到近排列，然后按该顺序渲染它们。

With this sort algorithm, we loop through each position in the array, from top to bottom, and then for each of those positions, we have to loop through the array to find the smallest number to swap.

使用这种排序算法，我们从上到下遍历数组中的每个位置，然后对于每个位置，我们必须遍历数组以找到要交换的最小数字。