Big-O notation is a way to describe a function that represents the n amount of times a program/function needs to be executed.
(I'm assuming that := is a typo and you mean just =, by the way)
In your case, you have two loops, nested within each other, and both loop to n (inclusive, meaning, that you loop for when i or j is equal to n), and both loops iterate by 1 each loop.
This means that both loops will therefore execute an n amount of times. Now, if the loops were NOT nested, our big-O would be O(2n), because 2 loops would run an n amount of times.
HOWEVER, since the j-loop is nested within i-loop, the j-loop executes every time the i-loop <span>ITERATES.
</span>
As previously mentioned, for every i-loop, there would be an n amount of executions. So if the i-loop is called an n amount of times by the j loop (which executes n times), the big-O notation would be O(n*n), or O(n^2).
(tl;dr) In basic, it is O(n^2) because the loops are nested, meaning that the i-loop would be called n times, and for each iteration, it would call the j-loop n times, resulting in n*n runs.
A way to verify this is to write and test program the above. I sometimes find it easier to wrap my head around concepts after testing them myself.
The first challenge is that there is not electric conection.So the computer won't be able to function.Also there will be noone who will be able to use it due to the lack of education.Plus there will not be internet connection , limitting the abilities of the computer to the very basics.In addition there will not be any tools or spare parts in order to fix a computer.Finally even if thete were spare parts there woul not be someone able to gix the computer.
I hop I was helpful.Let me know if you need anything else.
Heres some:
Quantum computing
Machine Learning
Medicine
Aeronautical Engineering (Drones, better transportation)
Answer:
Memory (RAM) is lost when computer is turned off.
