Answer:
c.O(n)
Explanation:
In the array based list implementation of the ADT the worst case time complexity of the getEntry method is O(n).In the worst case it has to travel upto n elements then it has to do the operation.In doing so the time complexity will come out to be O(n).So we conclude that the answer to this question is O(n).
The limitation of computer are:
- No self-intelligence
- No feeling
- No learning power
- Dependency
<span>Large headphones are essentially just two loudspeakers mounted on a strap that clamps firmly over your head. Earbuds work
the same way but, as you would expect, everything inside them (the
magnet, the coil of wire, and the diaphragm cone that makes sound) is
shrunk down to a much smaller size.</span>
int sum = 0, n;
do {cin>>n; sum+=n;}while (n!=0);
cout<<sum;
