title: Searching an unsorted array
body: <p>What would be the smallest and largest number of comparisons in an unsorted array that could have duplicate elements as well ?</p>
  
  <p>I understand that finding anything in an unsorted array is a O(n) problem. But, is this true if the array contains duplicate elements as well ?</p>
  
  <p>By duplicate elements I mean, elements that occur more than once in the given array. </p>