That's just what we think 那正是我们所想的
But before we get to that, in terms of thinking just think, OK, this is representing my particle, this is representing my electron that's what the wave function is.
但是在我们谈论那个部分之前,在理解方面,仅仅是理解,好的,它代表了粒子,它代表了电子,这就是波函数。
And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here?
这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西?
I think that's just temperamentally what we are.
我觉得那只是暂时的自己。
It's just kind of fun to think about that, so that's what we are doing.
想想那些只是为了有趣,我们所要做的事情
So let's just think exactly what this means, and that means that if we take away function and we define it in terms of n, l and m sub l, what we're defining here is the complete description of an orbital.
让我们来考虑一下这是什么意思,这是说如果我们不考虑波函数,而是用n,l,m下标l来定义它,我们定义的,是一个轨道的完整描述。
And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.
这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西?,是列表的大小和对其进行查找的频率吗?,这里面临一些取舍,但是我还没有说明,怎样得到一个n,log,n复杂度的排序算法,并且这是我今天想要讲的内容。
应用推荐