bpo-33957: Doc: Use better wording (GH-7912)

(cherry picked from commit 866c168a5f9330d8a3ae109fa8baab2509f35cc7)

Co-authored-by: Srinivas Reddy Thatiparthy (శ్రీనివాస్ రెడ్డి తాటిపర్తి) <srinivasreddy@users.noreply.github.com>

diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
index edc9c12aecfa89b02462c4e0d7440ef2f0cf5d99..c2bf37a7a82ea877744313785046cdd0efd05aff 100644 (file)
--- 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?