Sort (Bubble Sort v.1)

function sort(arr){
    for (let i=0; i < arr.length; i++){
        for(let j=0; j < arr.length; j++){
            if (arr[i] < arr[j]){
								let temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}

Sort (Bubble Sort v.2)

function sort(arr) {
  const n = arr.length;
  for (let i = 0; i < n - 1; i++) {
    for (let j = 0; j < n - 1 - i; j++) {
      if (arr[j + 1] < arr[j]) {
        let t = arr[j + 1];
        arr[j + 1] = arr[j];
        arr[j] = t;
      }
    }
  }
  return arr;
}

Search (Binary Search)

Can be used after sort

function search (arr, element){
    let left = 0;
    let right = arr.length - 1;
    let mid;
    while(left <= right){
        mid = Math.round((right - left) / 2) + left;
        if (element === arr[mid]){
            return true;
        } else if (element < arr[mid]){
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }
    return false;
}