Answer:
D. O(NlogN)
Explanation:
The computation of the overall algorithm cost is as follows:
Given that
O(logN) + O(N) × O(logN) + 1
In the case of complexity we considered the high order that dominates the other terms
Thus, that term would be
O(N) × O(logN)
It could be rewrite as
O(NlogN)
Hence, the correct option is D.
All the other options are wrong
He is a victim of plagiarism.
Plagiarism is when someone steals someone else's work, to help benefit themselves. Taking credit for the other person work.
Hope this helps!
Answer:
D) It creates a vector object with a starting size of 10 and all elements are initialized with the value 2.
Explanation:
When you write the statement vector<int> v(10,2); This statement declares a vector or dynamic array of size 10 that is the first parameter and the second parameter is the value with which all the elements in the vector are to be initialized.So in this vector all the 10 values will be initialized with the value 2.It is one of the way of initializing the vector.
