Алгоритм находит первое место, где два соседних элемента стоят в неправильном порядке и меняет их местами

const gnomeSort = (arr: number[]): number[] => {
  if (arr.length <= 1) {
    return arr
  }

  let i: number = 1

  while (i < arr.length) {
    if (arr[i - 1] <= arr[i]) {
      i++ //increment index if sub-array[0:i] already sorted
    } else {
      ;[arr[i], arr[i - 1]] = [arr[i - 1], arr[i]] //swapping two numbers
      i = Math.max(1, i - 1) //go back to the previous index to check the swapped number
    }
  }
  return arr
}

var obj = { first: "a", second: "b", third: "c" };
console.log(Object.keys(obj)); 

// консоль: [ 'first', 'second', 'third' ]

const user = {
  name: 'John',
  surname: "Smith",
  age: 35,
};

console.log(Object.values(user));
// консоль: Array [ 'John', 'Smith', 35 ]

export const exponentialSearch = (
  array: number[],
  x: number
): number | null => {
  const arrayLength = array.length
  if (arrayLength === 0) return null

  if (array[0] === x) return 0

  let i = 1
  while (i < arrayLength && array[i] <= x) {
    i = i * 2
  }

  const start = Math.floor(i / 2)
  const end = Math.min(i, arrayLength - 1)
  const result = binarySearchIterative(array, x, start, end)

  return result
}