solvingToyProblems/sortingAlgorithms.js at master · ZainabOmar/solvingToyProblems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
//trying to sort using recursion:
//var example = [2, 5, 10, 8];
function bubbleSort (arr){
var counter = 0;
	if(arr.length === 0 || arr.length === 1){
		console.log("Nothing To Sort");
		return arr;
	}
  for (var i = 0; i < arr.length; i++) {
	  var x = arr[i];
	  var y = arr[i+1];

	  if(arr[i]>arr[i+1]){
	  	counter++;
		  arr[i+1] = x;
		  arr[i] = y;
	  }
}
if(counter > 0){
	bubbleSort(arr);
}else {
	return arr;
}
return arr;
}


function selectionSort (arr){

var min = function (array){
	var minimum = array[0];
	for(var i = 0; i <= array.length; i++){
		if(minimum > array[i]){
			minimum = array[i];
		}
	}
	return minimum;
}

if(arr.length === 0 || arr.length === 1){
		console.log("Nothing To Sort");
		return arr;
}

  for (var i = 0; i < arr.length; i++) {
  	var slicedArr = arr.slice(i, arr.length);
  		var mini = min(slicedArr);
  		var index = arr.indexOf(mini);
  		var firstEle = arr[i];
  		arr[i] = mini;
  		arr[index] = firstEle;
  	}
return arr;
}