从最低的级别开始,你能够看到的在成熟度中的下一个位置在哪里?
Starting from your lowest level, what is the next step-up in maturity that you already see?
最后指定的那个颜色将用来显示颜色条,直到到达颜色将发生改变的下一个位置点。
The last specified color will be used for the color bar, until the next position is reached, at which point the color changes.
末尾标签(pstr_end)给出下一个位置地址,减去启始标签地址就得出大小。
The end label (pstr_end) gives the next location address, and subtracting the starting label address gives the size.
OK. The next largest element has to end up in the second last spot. Et cetera. All right, so it's called bubble sort because it does this bubbling up until it gets there.
好的,下一个最大元素又,能跑到倒数第二的位置,等等如此,好的,这称为冒泡排序,因为这个泡泡一直冒到他自己的位置。
And this would point to value, and this would point off someplace in memory.
需要多少个基本内存块,然后我就得知下一个元素的位置了。
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.
首先是插入排序,在此算法中,需要遍历整个列表,将你遇到的第一个元素放在其正确的位置,然后移动到下一个元素,继续处理-,不管是什么元素,都将其插入到合适的位置。
应用推荐