The answer to this question would be:
database/records
They all have in common the same files.
Answer:
The output is second half of the month, refers to both
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
Matlab code is:
>> 
>> 
>> 
>> 
>> 
>>
>> ![Vc=[M(2,:) M(:,3)']](https://tex.z-dn.net/?f=Vc%3D%5BM%282%2C%3A%29%20M%28%3A%2C3%29%27%5D)
Explanation:
>>
>> 

1 7 13 19 25
3 9 15 21 27
5 11 17 23 29
>> 
>>
>> 

>> 
>>
>> 

>>
>>
>> ![Vc=[M(2,:) M(:,3)']](https://tex.z-dn.net/?f=Vc%3D%5BM%282%2C%3A%29%20M%28%3A%2C3%29%27%5D)

>>
The code is tested and is correct. If you put a semi colon ' ; ' at the end of every statement then your answer will be calculated but matlab doesn't show it until you ask i.e. typing the variable (Va, Vb, Vc )and press enter.