Talk about cyber bullying but also all of the advancement and conviences of technology
Hope that helps
Answer:
Time Complexity of Problem - O(n)
Explanation:
When n= 1024 time taken is t. on a particular computer.
When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.
When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.
It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).
If we double the speed of original machine then we can solve problems of size 2n in time t.
Answer:
B.
Explanation:
Based on the sampling methods provided in regards to the question it can be said that the method being used is called Simple Random. This refers to dividing the population into different group which are then chosen at random, giving each group an equal chance of getting chosen. Which is exactly what is going on in this scenario, as the day is divided into three parts and her mood is measured randomly during each part of the day.