一些简单的算法

//反转字符串
function revertStr(str) {
    var arr = str.split(" "), newArr = [];
    arr.forEach(function (item) {
        var length = item.length, newStr = "";
        for (var i = 0; i < length; i ++) {
            newStr += item.charAt(length - i - 1);    
        }
        newArr.push(newStr);
    });
    return newArr.join(" ");
}
console.log(revertStr("qazsew ab"));

 //从小到大,冒泡
function sortArr(arr) {
    var length = arr.length, temp;
    for (var i = 0; i < length; i++) {
        for(var j = i+1; j < length; j ++) {
            if (arr[i] > arr[j]) {
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
    return arr;
}
var arr = [1,5,7,9,2,4];
arr.sort(function (a, b) {
    return a - b;
});
//console.log(arr);
//console.log(sortArr(arr));

 //查找数组的下标
function findIndex(arr, target) {
     var newArr = [], len = arr.length, i = 0;
     while(i < len) {
         var data = target - arr[i];
         var index = arr.findIndex((item) => item === data);
         if (index !== -1) {
             newArr.push(i);
             newArr.push(index);
             break;
         }
         i++;
     }
     return newArr;
 }
 console.log(findIndex([1,23,4,5,6,77], 100));