This   level-5 vital article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science Mid‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{ WikiProject Computer science}}

Hi, I would argue that since time complexity has its own page, it would make sense to mirror that with a complete page on space complexity. That, or it should be incorporated into time complexity's page. There doesn't seem to be enough specific discussion in the algorithm complexity page about space concerns.

This page is highly theoretical and doesn't give an intuitive understanding of space complexity. I suggest adding examples to make this more clear — Preceding unsigned comment added by Brainstudent87 ( talk • contribs) 17:40, 4 November 2019 (UTC) reply

It would be useful in the top sections to have a formal definition of space complexity (and honestly on time complexity) from a theoretical point of view. What's more, the final section on Auxiliary Complexity seems to contradict the sections before it; since a class like LOGSPACE can't exist if the input is considered part of the space used by an algorithm, having a specific section that implies that the 'usual' definition would consider input as part of the space used (since otherwise the space would hardly be considered auxiliary) feels off and at the very least needs some clarification. — Preceding unsigned comment added by 73.83.145.112 ( talk) 17:10, 20 January 2023 (UTC) reply