荷兰国旗问题是一个著名的算法问题。

Dutch National Flag problem is a famous algorithm problem.

youdao

从而解决了求有向回路基集的有效算法问题。

Thus, the problem of efficiently finding the basic set of directed circuits in a digraph is solved.

youdao

论文建立此类问题的网络优化模型，并研究其基本性质及算法问题。

In this paper we establish a network optimization model for this practical problem, and study its basic properties and algorithmic aspects.

youdao

So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.

你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。

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

Cut the problem in half. Cut the problem in half again. And that's a typical characterization of a log 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.

这是此算法中很明显的一句话，也是正确解决,整个问题的关键,否则此算法就会陷入死循环。

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