From cad5a98df90dfd811ceb8f737f89e96f56246954 Mon Sep 17 00:00:00 2001 From: Srinivas Reddy Thatiparthy Date: Mon, 25 Jun 2018 23:59:04 +0530 Subject: [PATCH] use correct term in place of generic wording --- Doc/faq/design.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst index edc9c12aecfa89..c2bf37a7a82ea8 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?