diff --git a/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp b/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp
index da8fe9046..0b20ecc77 100644
--- a/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp
+++ b/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp
@@ -22,7 +22,7 @@ class Solution {
         for(int i = 0; i < nums1.size(); i++)
             inter1.insert(nums1[i]);//get all of the unique elements in nums1 sorted
         for(int i = 0; i < nums2.size(); i++)
-            if(inter1.find(nums2[i]) != inter1.end())//search nums1 in O(logN)
+            if(inter1.find(nums2[i]) != inter1.end())//search inter1 in O(logN)
                 inter2.insert(nums2[i]);//populate the intersection set
         for(set<int>::iterator it = inter2.begin(); it != inter2.end(); ++it)
             solution.push_back(*it);//copy the set into a vector