Which may take up some arbitrary amount of memory. In that case, I'm back to this problem.

然后将接下来的每一个内存块设置为,指向数组对应元素值的指针。

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

They can be 64 bits, but very often on systems today are pointers 32 bits.

也可能为64位，但在通常的,系统中，指针占32位。

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

I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

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

This spring is getting squashed on either side, and it'll squash by certain amount x, that depends on your mass, and that x will be turned into a motion of a needle and that'll read your mass.

这个弹簧两边都会受到压缩,压缩量为 x,它由你的质量决定,x 会转换成指针的运动,你从而可以读数

耶鲁公开课 - 基础物理课程节选

Now that's changing the more years that pass the more of you have 64-bit computers and the more servers have many, many gigabytes of RAM and so you need actually 64-bits, but for now let's assume a common system whereby a pointer just by definition of the homework is 32 bits.

现在计算机也在改变，也有更多的人,使用64位的计算机，更多的服务器有很多，很多G的内存，那样你就需要64位的，现在我们假设通常的系统中,根据家庭作业所定义的，一个指针为32位。

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