the condition bug in findMinimumInRotatedSortedArray

[jarvinia]

findMinimumInRotatedSortedArray.II.cpp line52,53
In this clause, num[low] always less than num[mid], but if num[low] is equal to num[mid], how then?

[haoel]

consider this case:

[ 1, 1, 1, 1, 2, 2, 2, 2, 1 ]
  ^                       ^
 low                     high

this first while loop at line 46 moves low pointer to the position of the first 2

[ 1, 1, 1, 1, 2, 2, 2, 2, 1 ]
              ^           ^
            low         high

then, mid = low + (high - low)/2; the mid pointer also points to 2, so, num[low] == num[mid]

[jarvinia]

if (num[low] <= num[mid] && num[mid] <= num[high]){ return num[low] < num[mid] ? num[low] : num[mid]; }

so it always return num[low], whenever num[low] < num[mid] or num[low] = num[mid]

[haoel]

oh, yes! You are right!! I misunderstood your original question. Sorry.