Find Pivote of Sorted Array (Rotated or Non Rotated)

FindPivote

//O(log(N)) complexity
public <T extends Comparable<T>> static in findPivote(T[] array){
  int low = 0;
  int hight = array.length - 1;
  while(array[low].compareTo(array[high])>0){
    int mid = low + (high -low)/2;
    if(array[mid].compareTo(array[high])>0){
      low = mid + 1;
    }else{
      high = mid;
    }
  }
  return low;
}