The correctness of this algorithm is intuitively clear.
这种算法的正确性是很显然的。
This algorithm is not perfect and certain edge cases exist.
这个算法并不是很完美,并存在某些边缘情况。
The constraint of this algorithm is that a local element is not allowed to be declared with the same name of a global element.
这个算法的限制是局部元素不能声明为与全局元素同名。
It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?
这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢?
So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.
你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。
Now, as obvious a statement as that is in this algorithm, it turns out that is the key to this whole problem being solved correctly without my algorithm looping infinitely.
这是此算法中很明显的一句话,也是正确解决,整个问题的关键,否则此算法就会陷入死循环。
应用推荐