selection sort

a far worse algo than mergesort

JavaScript

function bubbleSort() {
	var array=[];
  for (var num=0; num < 10000; num++) {
  	array.push(Math.floor(Math.random() * 10000));
  }
  
	var t1, t2, count = 0;
	t1 = performance.now();
	var temp, swapped = false;
  
	for (var i=0; i< array.length -1; i++) {
  	for (var j=0; j < array.length - i - 1; j++) {
    	count++;
    	if (array[j] > array[j+1]) {
      	swapped =true;
      	temp = array[j];
        array[j] = array[j+1];
        array[j+1] = temp;
      }
    }
    !swapped && (i = array.length);
  }
  t2= performance.now();
  console.warn('Time taken -> ', t2-t1);
	return array;
}

console.log(bubbleSort());