Answer:
The reason it boils down to log n is because as n gets larger, log(log(n)) increases slowly (try it on a calculator). 3log(n) is the one that really grows. But after a sad amount of iterations, the factor of 3 wouldn't matter. So, we say the BEHAVIOUR (or Big Omega Ω) of 3 log(N) + log(log(n)) is pretty much the same as log(n).
O(n) would also be 3 logn(n).
to understand this, we need to understand what these two notations mean. Ω is like a lower bound. It states that eventually, the function, for all values, will be greater than the Ω of that function. This is the blue line in the graph attached below. And O means that the function will remain inside, neither more nor less than the O notation.
Search engines. (I'm Misty btw if you want to know)
<u>When a programmer declare single dimension or double dimensions array they use box bracket with index number to access the cell number.</u>
int a[10]; = where a is variable name declared with data type as integer and which hold 10 values.
Each is access with cell number or index number surrounded by box brackets
Example a [4] where “a” is variable number and “4” is index number or cell number. By refer “4” user is access the 4 cell data
Maximum “a” single dimension store total of 10 number where cell number or index number starts from 0 to 9.
Answer:
Mobile are build in a specific platform such as Android, iOS ect and they use application such as apple store and have access to the system such as GPS and the camera. Mobile apps live and run on mobiles as on they are their own thing controlled by a developer on the other end
Explanation:
