rdsimp

function addNumbers(numbers) {
  const n = numbers.length;
  let sum = 0;
  for (let i = 0; i < n; i++) sum += numbers[i];
  return sum;
}

rdsimp

function addToLimit(limit) {
  let sum = 0;
  for (let number = 1; number <= limit; number++) sum += number;
  return sum;
}

rdsimp

function binarySearch(list, target) {
  let start = 0
  let end = list.length - 1
  while (start <= end) {
    const middle = Math.floor((start + end) / 2)
    if (list[middle] === target) return true
    else if (list[middle] < target) start = middle + 1
    else end = middle - 1
  }
  return false

rdsimp

function countOperations(n) {
  let operations = 0
  for (let i = 0; i < n; i++) operations++
  for (let i = 0; i < n; i++) operations++
  return operations
}

rdsimp

function sort(list) {
  const n = list.length
  for (let i = 0; i < n; i++)
    for (let ii = 0; ii < n; ii++)
      if (list[ii] > list[ii + 1]) {
        const temp = list[ii]
        list[ii] = list[ii + 1]
        list[ii + 1] = temp
      }
  return list