From ae04e1aa9ce85be78a863baab3f7d9f4145e439d Mon Sep 17 00:00:00 2001 From: penkovski Date: Sat, 19 Dec 2020 01:25:57 +0200 Subject: [PATCH] Fix a typo slip-up --- tutorial/09.markdown | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/tutorial/09.markdown b/tutorial/09.markdown index 361a58c..d6c193e 100644 --- a/tutorial/09.markdown +++ b/tutorial/09.markdown @@ -1,7 +1,7 @@ The next data structure that we'll look at is a set. A set is similar to a list, except it does not have a specific order and each element may only appear -once. Both the data structures are very useful because while in a list -is fast to access the elements near the top or the bottom, and the order of +once. Both data structures are very useful because while in a list +it is fast to access the elements near the top or the bottom, and the order of the elements is preserved, in a set is very fast to test for membership, that is, to immediately know if a given element was added or not. Moreover in a set a given element can exist only in a single copy.