js算法（基础）

数组去重

function qc(arr1){
//创建一个新的数组
	let arr = [];
//遍历数组arr1
	for( let i = 0; i < arr1.length; i++) {
//如果arr1不在arr中 会返回-1 那么将和这个元素存在新建的arr中
		if( arr.indexOf(arr1[i]) == -1) {
				arr.push(arr1[i])
		}
	}
//返回arr
	return arr;
}
arr1 = ["1","1","3","5","2","24","4","4","a","a","b"];
		
console.log(qc(arr1));
//输出结果["1", "3", "5", "2", "24", "4", "a", "b"]

冒泡排序

function sort(elements) {
	for(var i=0;i<elements.length - 1;i++){
		for (var j=0;j<elements.length-i-1;j++){
           //两个for循环 依次比较 把较大的数记录下来给后面 依次类推 达到排序的结果
			if(elements[j]>elements[j+1]){
				var swap = elements[j];
				elements[j]=elements[j+1];
				elements[j+1]=swap;
			}
		}
				
	}
	return elem