title: How to check if 2 c++ arrays are identical (all elements are the same, order matters) in O(1) or O(log n) time complexity?
body: <p>Obviously, one could just use a for loop that checks every element of both arays, but I would like my program to be fast, so I would like to have a faster solution. </p>
  
  <p>For example:
  <strong><br>Array a: [1,3,2,10,12] 
  <br>Array b: [1,3,2,10,12] 
  <br>The arrays are identical</strong></p>
  
  <p>Whereas
  <strong><br>Array c: [1,3,2,10,12]
  <br>Array d: [2,1,3,12,10]
  <br>The arrays are NOT identical</strong></p>
  
  <p>Does the '=' operator do the trick or is it harder?</p>