n It takes discrete values, multiples of some integer n, and the multiplication factor is the ratio of the Planck constant divided by 2 pi where n takes one, two, three and so on.
这些离散的值乘以整数,乘积因子,是普朗克常数除以2π,其中n可以取1,2,3,等等。
And is no longer that sole determining factor for energy, energy also depends both l on n and on l.
对于能量的,唯一决定性因素,它也依赖于n和。
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的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素?
应用推荐