algorithms in javascript

script.js

2. Divide and Conquer

function diffSum (arr){
  if(arr.length === 0) return 0;
    return arr[0] + sum(arr.slice(1))
  }
sum([1, 2, 3])

3. Select Sort

const itemsToSort = [3, 2, 4, 1, 6]

function findLargetstValue(list){
let lrg = list[0];
let indexOfLarge = 0
for( let i = 1; i <= list.length; i++) {
  if(lrg < list[i]) {
    lrg = list[i]
    indexOfLarge = i
  }
}
return indexOfLarge
}

function newSelectionSort(list){
  let newList = []
  let lrgItem
  while(list.length) {
    lrgItem = findLargetstValue(list)
  newList.push(list[lrgItem])
  list.splice(lrgItem, 1)
  }
  return newList
}