Insertion Sort Example in JS -

function insertionSort(mn){

    var n = mn.length;

    for(var i= 1; i <= n-1; i++){

      var j = i - 1;

      var key = mn[i];

         while(j >= 0  && mn[j] > key){

              mn[j+1] = mn[j]

              j--;

         }

         mn[j+1] = key;

    }

    return mn;

};

var mn = [34, 6, 793, 3000, 6, 7, 245];

insertionSort(mn);

Output:

 [6, 6, 7, 34, 245, 793, 3000]

Binary Search Example in JS -

 

Solution :

function binarySearch(arr, val, start, end){

    let mid  =  Math.floor((end - start) / 2);

    if(arr[mid] === val){

        return mid;

    }

    if(arr[mid] > val){

        start = start;

        end = mid    

        return binarySearch(arr, val, start, end);

    }

    if(arr[mid] < val){

        start = mid;

        end = mid    

        return binarySearch(arr, val, start, end);

    }

}

var arr = [72, 3, 6, 8, 9, 25, 4, 18];

//first sorting the given array

arr..sort(function (a, b) {  return a - b;  });    OR   arr.sort((a, b) => a-b);

[3, 4, 6, 8, 9, 18, 25, 72]

var res = binarySearch(arr, 6, 0, arr.length);

console.log(res);

Output:  2

Bubble Sorting Example in JS -

Qus:  Sort this Array  [34, 5, 8, 26, 9, 47, 62, 3];

Solution : 

var in = [34, 5, 8, 26, 9, 47, 62, 3];

for(let j =0; j < (arr.length-1); j++){

   for(let i =0; i < (arr.length-1); i++){

        if(arr[i] > arr[i+1]){

               let temp =  arr[i];

                arr[i] = arr[i+1];

                arr[i+1]  = temp;

        }

    }

}

Result :

 [3, 5, 8, 9, 26, 34, 47, 62]