diff --git a/src/binary-reversal/index.js b/src/binary-reversal/index.js index 965bccf4..22843359 100644 --- a/src/binary-reversal/index.js +++ b/src/binary-reversal/index.js @@ -3,6 +3,21 @@ * * * @param {string} value */ -function binaryReversal(value) {} + function binaryReversal(value) { + var value = Number(value); + var valueInBinary = value.toString(2); + + var binArray = valueInBinary.split(''); + var num = valueInBinary.length + if (binArray.length < 8) { + for (let i = 0; i < (8 - num); i++) { + binArray.unshift('0'); + + } + } + var reversal = binArray.reverse(); + + return parseInt(reversal.join(''),2).toString(); +} module.exports = binaryReversal; diff --git a/src/list-sorting/index.js b/src/list-sorting/index.js index 6636c20d..1a76bd47 100644 --- a/src/list-sorting/index.js +++ b/src/list-sorting/index.js @@ -1,3 +1,52 @@ -function listSorting(needle, haystack) {} +function listSorting(needle, haystack) { + var arr = haystack; + var index = ''; + var answer = [];//level, indexOf + var holder = ''; + + if (typeof(arr[0]) === 'number') { + + for (let i = 0; i < arr.length; i++) { + if (arr[i] == needle) { + index = i; + } + + } + }else if(typeof(arr[0]) === "object"){ + + for (let k = 0; k < arr.length; k++) { + if (arr[k].indexOf(needle) == -1) { + + continue; + }else{ + if (typeof(arr[k][0] == 'number')) { + + for (let x = 0; x < arr[k].length; x++) { + if (arr[k][x] == needle) { + index = k; + holder = x; + } + + } + } + } + + } + } + answer.unshift(index); + if (holder !== '') { + answer.push(holder); + } + if (answer == '') { + return -1; + }else{ + if (answer.length == 1) { + return Number(answer.join('')); + }else{ + return answer; + } + } +} module.exports = listSorting; +