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.
This may be a difficult thing to do so for anyone to ACTUALLY answer this you migghttt want to up the amount of points you get for answering maybe, 20-40 points.
Answer:
positive bc you can learn from them wwhat to do what not to do mistakes that you wont make in. real life
Hehdhdjdjddjdjid iridium chi jo j o j o j o j
It would help if there is a programming language in the context of which you need this answered. For instance in Python you can create a program like this:
print(type("Hello"))
print(type(1337))
print(type(True))
print(type("3.14"))
It will return:
<class 'str'>
<class 'int'>
<class 'bool'>
<class 'str'>
