So the first one here is something called insertion sort which amounts to going through the list, taking the first thing that you see and inserting that element into its correct place, - then moving on to the next one, dealing with what element-- whatever element you're given and putting it in its right place.

首先是插入排序,在此算法中，需要遍历整个列表,将你遇到的第一个元素放在其正确的位置，然后移动到下一个元素，继续处理-,不管是什么元素,都将其插入到合适的位置。

哈佛公开课 - 计算机科学课程节选

So we can think of a third case where we have the 3 s orbital, and in the 3 s orbital 0 we see something similar, we start high, we go through zero, where there will now be zero probability density, as we can see in the density plot graph.

第三个例子那就是,3s轨道,在3s轨道里，我们看到类似的现象,开始非常高，然后穿过，这里，概率密度是0，就像你们在概率密度图里看到一样，然后我们到负的。

麻省理工公开课 - 化学原理课程节选