Merge pull request #4109 from SansPapyrus683/master

two pointers wording

Author: bqi343

content/3_Silver/Two_Pointers.mdx

@@ -431,13 +431,13 @@ print(ans)
     <Quiz.Answer>
       The time complexity of a standard two pointers algorithm is $\mathcal{O}(N)$ when not considering any other operations on the array.
       <Quiz.Explanation>
-        Incorrect. Assuming that both pointers move one step at a time and the array isn't sorted, both pointers would take a maximum of $N$ steps.
+        Incorrect. Assuming that both pointers move one step at a time, both pointers would take a maximum of $N$ steps.
       </Quiz.Explanation>
     </Quiz.Answer>
     <Quiz.Answer>
       The space complexity of a standard two pointers algorithm is $\mathcal{O}(1)$ when not considering the space taken up by the array.
       <Quiz.Explanation>
-        Incorrect. Assuming that both pointers move one step at a time and the array isn't sorted, there would be a constant space complexity.
+        Incorrect. Assuming that both pointers move one step at a time, there would be a constant space complexity.
       </Quiz.Explanation>
     </Quiz.Answer>
     <Quiz.Answer correct>