Answer:
Running time of algorithm is O(n).
Explanation:
n is power of 2
n =2,4,8,16,32,...................................
A is an array having n elements
B is an array of size 0 to (n/2)-1
if n=4 B then (4/2)-1 =1 So B has size 2
for(i=0;i<=(n/2)-1;++)
{
B[i]=A[2i]+A[2i+1];
}
This for loop will run n/2 times so complexity in terms of Big Oh is O(n/2) =O(n)
Running time of algorithm is O(n).
Answer:
<u>documents database</u>
Explanation:
This database is most appropriate because we need to remember that a <u>note-taking app</u> would not necessarily need too many functions apart from the basics text input operations.
Also, we need to note that the digital infrastructure required to build a documents database, is very convenient for a startup because they may have lesser resources.
The communication device that <span>sends and receives data and information to and from a digital line, such as ISDN and cable is the broadband modem, or also called digital modem, in a case when the line is digital. If the line is ISDN than the modem is called ISDN modem. </span>
