Once I have it sorted I can search it in log n time, but that's still isn't as good as just doing n. And this led to this idea of amortization, which is I need to not only factor in the cost, but how am I going to use it?

一旦对其完成排序,就可以在log，n的时间内对其完成搜索,但是这样做仍然不如n的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？

麻省理工公开课 - 计算机科学及编程导论课程节选

I think most and you are familiar with the Aufbau or the building up principle, you probably have seen it quite a bit in high school, and this is the idea that we're filling up our energy states, again, which depend on both n and l, one electron at a time starting with that lowest energy and then working our way up into higher and higher orbitals.

我认为你们大多数熟悉奥弗堡,或者构建原理，你们可能,在高中见过它，又一次,这是我们填充能级的观点，与n和l有关，一个电子每次从,最低的能级开始,然后以我们的方式上升到,更高更高的轨道。

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