Verified65% confidenceFactExact time
Cyclomatic complexity was proposed by Thomas McCabe in 1976, calculated as M = E - N + 2P, and the industry typically sets the upper limit of cyclomatic complexity for a single module at 10–15.
3
Sources
65%
Confidence
Long-term
Relevance
7/21/2026
First Seen
Sources
Related Claims
VerifiedCyclomatic Complexity was proposed by Thomas McCabe in 1976 to measure the complexity of a program's control flow.80% similarUnverifiedThe division optimization technique of multiplying by a magic number and shifting originates from 'Hacker's Delight' (by Henry S. Warren Jr.), based on the principle n/d≈(n×M)>>k, where M≈2^k/d.57% similarUnverifiedFermat's Last Theorem states that when the integer n is greater than 2, the equation x^n + y^n = z^n has no positive integer solutions.55% similarUnverifiedThe core issue involved in the discovery is a factorial normalization discrepancy between the original moment M_n and the Taylor/Jensen coefficients.55% similarUnverifiedThe new contribution of this paper is the first exact characterization at the doubly logarithmic scale under the output-law criterion, and the establishment of a strict round complexity separation between the two metrics.55% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/578531API
curl https://kongchang.com/api/v1/knowledge/claims/578531MCP
get_claim(id=578531)