summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorAndre Polykanine <ap@oire.me>2018-10-23 01:18:15 +0300
committerGitHub <noreply@github.com>2018-10-23 01:18:15 +0300
commit8675fad4c753bc21496c83e5c51d29a6753ff1e8 (patch)
tree8b9334b2ab1fa232c748b3815afdeb9eb9a4836f
parent0b8fd8ff21fa3a2aaa05ed7514b7a1eadbabb953 (diff)
parent00bb4b8a70f4ddd09ce4243e817fba2c489646da (diff)
Merge pull request #3323 from ankushagarwal/patch-2
[c++/en] efficient typo fix
-rw-r--r--c++.html.markdown4
1 files changed, 2 insertions, 2 deletions
diff --git a/c++.html.markdown b/c++.html.markdown
index 225472cb..4113d5f4 100644
--- a/c++.html.markdown
+++ b/c++.html.markdown
@@ -1057,7 +1057,7 @@ cout << ST.size(); // will print the size of set ST
// Output: 0
// NOTE: for duplicate elements we can use multiset
-// NOTE: For hash sets, use unordered_set. They are more effecient but
+// NOTE: For hash sets, use unordered_set. They are more efficient but
// do not preserve order. unordered_set is available since C++11
// Map
@@ -1086,7 +1086,7 @@ cout << it->second;
// Output: 26
-// NOTE: For hash maps, use unordered_map. They are more effecient but do
+// NOTE: For hash maps, use unordered_map. They are more efficient but do
// not preserve order. unordered_map is available since C++11.
///////////////////////////////////