summaryrefslogtreecommitdiff
path: root/Doc/faq
diff options
context:
space:
mode:
authorSrinivas Reddy Thatiparthy (శ్రీనివాస్ రెడ్డి తాటిపర్తి) <srinivasreddy@users.noreply.github.com>2018-06-26 13:57:05 +0530
committerINADA Naoki <methane@users.noreply.github.com>2018-06-26 17:27:05 +0900
commit866c168a5f9330d8a3ae109fa8baab2509f35cc7 (patch)
tree2d95e7a80637bbc0d5572999f7169c9973f93285 /Doc/faq
parent42397731d7ba8bdf63025d48008d133cb2070229 (diff)
downloadcpython-git-866c168a5f9330d8a3ae109fa8baab2509f35cc7.tar.gz
bpo-33957: Doc: Use better wording (GH-7912)
Diffstat (limited to 'Doc/faq')
-rw-r--r--Doc/faq/design.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
index edc9c12aec..c2bf37a7a8 100644
--- a/Doc/faq/design.rst
+++ b/Doc/faq/design.rst
@@ -500,7 +500,7 @@ on the key and a per-process seed; for example, "Python" could hash to
to 1142331976. The hash code is then used to calculate a location in an
internal array where the value will be stored. Assuming that you're storing
keys that all have different hash values, this means that dictionaries take
-constant time -- O(1), in computer science notation -- to retrieve a key.
+constant time -- O(1), in Big-O notation -- to retrieve a key.
Why must dictionary keys be immutable?