@Webdev

// perform the bubble sort function bubleSort(arr,n){ // loop to access each array element bool swapped; for(let i=0;i<n-1;i++){ // loop to compare array elements for(let j=i+1;j<n-i-1;j++){ swapped=false; // compare two adjacent elements // change > to < to sort in descending order

function swapString(arr,minIndex,i){ if(minIndex != i){ var temp = arr[minIndex]; arr[minIndex] = arr[i]; arr[i] = temp; } } function sortStringArray(arr,n){ for(let i=0;i<n-1;i++){

//This function used to add Sorted element in new array with ascending order function swapElement(arr,xl,yl){ var temp = arr[xl]; arr[xl] = arr[yl]; arr[yl]=temp; } function sortArray(arr,n){ var i,j,min_idx;

function BinarySearchIndex(arr,key){ var low = 0; var high = arr.length-1; while(high>=low){ var m =low + Math.floor((high-low)/2); if(arr[m] == key) return m; else if(arr[m]<key) low = m+1;

let arr = [1,2,3,4,5,6,7,8,9]; let n = 9; let key = 6; //Search Element Using BinarySearch by divide the array into internal's function BinarySearch(arr,key){ var low = 0; var high = arr.length-1; while(high >= low){

//Insert Element At the End function InsertElement(arr,key,n,capcity1){ //Check Array Size First Before insert to check either we have space to add if(n >= capcity1) return n; //Add Value the n index arr[n]=key return (n+1);

let array = [1, 3, 5, 8, 10, 13, 15, 18, 20]; let key = 15; let N = array.length-1; //Find index number of element in array function findIndex(arr,key,n){ for(let i=0;i<n;i++) if(arr[i]==key) return i; return -1;

//Delete Element On Certain Postion function FindPosition(arr,n,key){ for(let i=0;i<n;i++){ if(arr[i]==key) return i; } return -1; }

//Insert Element On Certain Postion function InsertAtPostion(arr,key,pos,n){ for(let i= n-1;i>=pos;i--){ arr[i+1]=arr[i]; } arr[pos]=key; }