rpmFhk - Online JavaScript Interpreter & Debugging Tool

// your code goes here

function bubbleSort(arr, n) {
	// n=5, i=0, j<4, j=0, 1, 2, 3
	// n=5, i=1, j<3, j=0, 1, 2
	let swapped;
	for(let i=0;i<n-1;i++){ // i is the iteration no
		swapped = false;
		for(let j=0;j<n-i-1;j++) {
			if(arr[j] > arr[j+1]) {
				let tmp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = tmp;
				swapped = true;
			}
		}
		if(swapped == false) {
			break;
		}
	}
	return arr;
}

// TC: O(n^2)
// SC: O(1)

// console.log(bubbleSort([8, 3, 1, 9, 4], 5))

function selectionSort(arr, n) {
	for(let i=0;i<n-1;i++) {
		// find the index of the mimimum element from i to n-1
		// and swap that with ith element
		let min_elem_idx = i;
		for(let j=i+1;j<n;j++) {
			if(arr[j] < arr[min_elem_idx]) {
				min_elem_idx = j;
			}
		}
		// swap arr[min_elem_idx] with arr[i]
		let tmp = arr[i];
		arr[i] = arr[min_elem_idx];
		arr[min_elem_idx] = tmp;
	}
	return arr;
}

console.log(selectionSort([8, 3, 1, 9, 4], 5))