从集合中随机显示N个元素 srandmember key N
Now, it's kind of a cyclical argument here because how do you sort the left half of N elements?
在这儿有点循环的意思,那么如何对N个元素中的左半部分进行排序呢?
I'm accessing a list. How long does it take for me to get the nth element of a list?
我取得数组的第N个元素,需要多长时间呢?
So I propose this as a new algorithm for sorting N elements and being 8 in this case or really a thousand in the case of the phonebook, or anything of larger size.
所以我提出一种新的算法,来解决N个元素的排序问题,在这个问题中N是8,在电话簿的问题中N是一千,或者是大规模的任何问题。
应用推荐