通过检查秩数复杂度方法，我已经发现了通过以下问题推出复杂性是有用的：确定系统进入某种状态有多难？

By inspecting the cyclomatic complexity measures, I have found it useful to reason about complexity via the following question: How hard is it to determine how a system got into a certain state?

youdao

圈复杂性公式(cyclomatic complexity formula)，被Thomas Mc Cabe首先提出，它是基于一个函数的分支数量来确定复杂度的。

The cyclomatic complexity formula, first developed by Thomas McCabe, is based on the number of branches in a function.

youdao

软件复杂度是为了预测软件开发费用、开发周期、可靠性的模块内程序逻辑复杂性的度量方法。

The complexity of software is a measure for program logic complexity in models, which could be used to predict its corresponding developing expense, its developing period and its reliability.

youdao

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

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