Algo. K shifted array. Find K

k-shifted-array.js

// TODO TEST

// given [3,4,5,6,7,8,9,1,2]
// return 7
const test1 = [3,4,5,6,7,8,9,1,2]
const test2 = [8,9,1,2,3,4,5,6,7]
const findk = list => {
  if (list[0] < list[list.length-1]) {
    return 0;
  }
  let leftIndex = 0;
  let rightIndex = list.length - 1;
  while (left < right) {
    let left = list[leftIndex]
    let right = list[rightIndex]
    let midIndex = Math.floor(list.length/2);
    let mid = list[midIndex]
    if left > mid 
      rightIndex = midIndex
    else 
      leftIndex = midIndex
  }
  return list[rightIndex];
}