Talk:Analysis of algorithms
Page contents not supported in other languages.
Appearance
From Wikipedia, the free encyclopedia
| This is the talk page for discussing improvements to the Analysis of algorithms article. This is not a forum for general discussion of the subject of the article. |
Article policies
|
| Find sources: Google (books * news * scholar * free images * WP refs) * FENS * JSTOR * TWL |
| Archives: 1, 2Auto-archiving period: 2 years |
| This level-5 vital article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||
This article has many trivial statements, eg "an inefficient algorithm can significantly impact system performance". Who is kidding whom? Or please consider the gem "A program can take seconds, hours, or even years to finish executing". And it has been tagged as needing better sourcing since 2010. A more serious problem is that the practical issue of worst case performance vs average performance is not clarified as it should have been. Yesterday, all my dreams... (talk) 15:38, 4 January 2026 (UTC)[reply]
Categories:
- C-Class level-5 vital articles
- Wikipedia level-5 vital articles in Mathematics
- C-Class vital articles in Mathematics
- C-Class mathematics articles
- Top-priority mathematics articles
- C-Class Computing articles
- High-importance Computing articles
- C-Class software articles
- High-importance software articles
- C-Class software articles of High-importance
- All Software articles
- C-Class Computer science articles
- Top-importance Computer science articles
- C-Class Computer hardware articles
- High-importance Computer hardware articles
- C-Class Computer hardware articles of High-importance
- All Computing articles