Jump to content

Talk:Programming complexity: Difference between revisions

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
Content deleted Content added
m top: removing unknown parameter in {{WikiProject Computing}}
Implementing WP:PIQA (Task 26)
Line 1: Line 1:
{{WikiProject banner shell|class=Stub|
{{WikiProject Computing
{{WikiProject Computing
|class=Stub
|importance=Mid
|importance=Mid
}}
}}
{{WikiProject Computer science|class=stub|auto=inherit}}
{{WikiProject Computer science|auto=inherit}}
}}


== Reference #4 leads to Access Denied XML snippet ==
== Reference #4 leads to Access Denied XML snippet ==

Revision as of 04:19, 1 February 2024

Reference #4 leads to Access Denied XML snippet

Not sure why, but Ref #4 leads to an Access Denied XML snippet Hydrogen18 (talk) 02:34, 18 July 2012 (UTC)[reply]

Assessment

I'm marking this article as Stub-class for a start, for the low quality of remaining content. But software metrics are important, so the importance is Mid (it could be High indeed). --Blaisorblade (talk) 03:46, 15 July 2008 (UTC)[reply]

Merge

It has been suggested [by User:Groupthink] that Cyclomatic complexity be merged into this article or section. (Discuss)

That's OK with me, especially with this page (Programming Complexity) becoming a redirect to Cyclomatic complexity. Erudecorp ? * 09:16, 30 November 2007 (UTC)[reply]

Confusion on the subject

This article confuses together the complexity of an algorithm (mentioned in the given link), and the complexity of production of the software in software engineering (see cyclomatic complexity, the link to Software crisis). As it stands, the article is of such low quality to deserve almost complete deletion of content; the topic is important however, and it deserves a page on Wikipedia. Possibly, however, this page could be simply changed into a redirect to Software metrics, or merged into it (I'll propose a merger with that article).

To start fixing it, I'm removing everything about algorithmic complexity, including the (undiscussed) merger proposal, and the single reference (which is about algorithmic complexity). I hope there is no need to open a discussion to close the merger proposal. --Blaisorblade (talk) 15:52, 16 June 2008 (UTC)[reply]

Citation wanted

″As the number of entities increases, the number of interactions between them would increase exponentially″ I stumbled upon this article while looking for a reference for exactly this assumption, as it is not obvious. Would you please include a citation? Thanks. Alvaro — Preceding unsigned comment added by 90.136.29.212 (talk) 17:03, 16 June 2012 (UTC)[reply]