Answer:
<u> A. It uses binary numbers in its algorithm</u>
Explanation:
A Binary search is a type of algorithm designed to look through <em>only </em>a sorted array of data for a particular item.
It is<em> more efficient (faster) </em>than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
Answer:
Abstraction
Explanation:
In computer science, abstraction has a similar definition. It is a simplified version of something technical, such as a function or an object in a program. The goal of "abstracting" data is to reduce complexity by removing unnecessary information. At some level, we all think of computers in abstract terms.
You have a raspberry pi connected to all the sensors and a code running to trigger if the sensors are triggered. Each sensor and keypad would run to a different input on the pi. They should al be able to be powered with a single cell lipo. Is that what you are asking?
Answer:
/*
I don't know what language you're using, so I'll write it in javascript which is usually legible enough.
*/
console.log(buildSequence(30));
function buildSequence(maxVal){
maxVal = Math.abs(maxVal);
var n, list = [];
for(n = 1; n < maxVal; n++){
/*
to check for odd numbers, we only need to know if the last bit
is a 1 or 0:
*/
if(n & 1){ // <-- note the binary &, as opposed to the logical &&
list[list.length] = n;
}else{
list[list.length] = -n;
}
}
return list.implode(',');
}
