nandhinibemec
BAN USER
Questions (3)
Followers (1)
Reputation 40
- 0of 0 votes
Answersamazon-interview-questions 8 Answers
- nandhinibemec in India
3-way-mergesort : Suppose instead of dividing in half at each step of the mergesort, you divide into thirds, sort each third, and finally combine all of them using a three way merge. What is the overall running time of this algorithm ? (Hint - Note that the merge step can still be implemented in O(n) time.)
n
nlog(n)
n^2(log(n))
n((log(n))^2| Report Duplicate | Flag | PURGE
- 0of 0 votes
AnswersYou are given functions f and g such that f(n)=O(g(n)). Is f(n)∗log2(f(n)c)=O(g(n)∗log2(g(n))) ? (Here c is some constant >0. You can assume that f and g are always bigger than 1.
- nandhinibemec in India
Depends on the choice of f and g
True
False
Depends on choice of c| Report Duplicate | Flag | PURGE
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.