function qSort(arr){
  if(arr.length < 2){
    console.log("here is the count " + count);
    return list;
  }
  let left = [];
  let right = [];
  let pivot = arr[0];
  for(let i = 0; i < arr.length; i++){
    if(arr[i] < pivot){
      left.push(arr[i]);
    } else{
      right.push(arr[i]);
    }
  }
  return [...quicksort(left), pivot, ...quicksort(right)];
}

function mSort(arr){
  if(arr.length === 1){
    return arr;
  }

  const middle = Math.floor(arr.length/2);
  const left = arr.slice(0, middle) // items on the left side
  const right = arr.slice(middle)

  return merge(
    mergeSort(left),
    mergeSort(right)
  )
}

function merge(left, right){
  let result = [];
  let indexLeft = 0;
  let indexRight = 0;
  while(indexLeft < left.length && indexRight < right.length){
    if(left[indexLeft] < right[indexRight]){
      result.push(left[indexLeft]);
      indexLeft++;
    } else {
      result.push(right[indexRight]);
      indexRight++;
    }
  }
  return result.concat(left.slice(indexLeft)).concat(right.slice(indexRight))
}

//bucket sort
const data = [1,8,5,2,9];
function insertionSort(array) {
  var length = array.length;
  for(var i = 1; i < length; i++) {
    var temp = array[i];
    for(var j = i - 1; j >= 0 && array[j] > temp; j--) {
      array[j+1] = array[j];
    }
    array[j+1] = temp;
  }

  return array;
}

// Implement bucket sort
function bucketSort(array, bucketSize = 5, minValue, maxValue) {
  if (array.length === 0) {
    return array;
  }

  // Declaring vars
  let  i;

  // Setting min and max values

  // Initializing buckets
  var bucketCount = Math.floor((maxValue - minValue) / bucketSize) + 1;
  var allBuckets = new Array(bucketCount);

  for (i = 0; i < allBuckets.length; i++) {
    allBuckets[i] = [];
  }

  // Pushing values to buckets
  array.forEach(function (currentVal) {
  	allBuckets[Math.floor((currentVal - minValue) / bucketSize)].push(currentVal);
  });

  // Sorting buckets
  array.length = 0;

  allBuckets.forEach(function(bucket) {
  	insertionSort(bucket);
  	bucket.forEach(function (element) {
  		array.push(element)
  	});
  });
  return array;
}


function shuffle(arr, times, count = 0){
  if(count === times){
    return arr;
  }
  let random1 = Math.floor(Math.random() * times);
  let random2 = Math.floor(Math.random() * times);
  let temp = arr[random1];
  arr[random1] = arr[random2];
  arr[random2] = temp;
  count+=1;
  return shuffle(arr, times, count)
}
// console.log(shuffle([1,2,3,4,5,6], 6));






  //////////////////////////////////////
let alphaMap = {'a': 1, "b":2, "c":3, "d":4, "e":5, "f": 6, "g":7, "h":8, "i":9,
"j":10, "k": 11, "l": 12, "m": 13, "n": 14, "o": 15, "p": 16, "q": 17, "r": 18, "s": 19, "t": 20,
"u":21, "v":22,"w":23,"x":24,"y":25, "z": 26}
console.log('alpha map c', alphaMap['c']);
function bookSort(arr, alphaMap){
  let results = [];
  for(let book of arr){
    let numStr = '';
    let itemMap = {};
    for(let i = 0; i < book.length-1; i++){
      numStr+= alphaMap[book[i]] + '.';
    }
    itemMap.name = book;
    itemMap.sum = numStr;
    itemMap.sum = itemMap.sum.substring(0, numStr.length-1)
    itemMap.sum = parseInt(itemMap.sum);
    results.push(itemMap);
  }
  return qSortSum(results);
}

function findLongestLength(arr){
  let maxCount = 0;
  for(let item of arr){
    let count = 0;
    for(let i = 0; i < item.sum.length; i++){
      count++;
    }
    if(count > maxCount){
      maxCount = count;
    }
  }
  return maxCount;
}


function qSortSum(arr, count = 0){
  if(arr.length < 2){
    return arr;
  }
  let left = [];
  let right = [];
  let pivot = arr[0];
  for(let i = 0; i < arr.length; i++){
    if(arr[i].sum < pivot.sum){
      left.push(arr[i]);
    } else if(arr[i].sum > pivot.sum){
      right.push(arr[i]);
    }
  }
  return [...qSortSum(left), pivot, ...qSortSum(right)];
}

console.log(bookSort(["catcher", "wizard", "nun", "soldier", "hobbit"], alphaMap));