Under which of the following Big O notation it is suggested to review design of algorithm?
O(nlogn)
O(n2)
O(n)
O(2n)
Answer: Option D.
Merge sort algorithm uses _________ technique
Brute force
Divide and conquer
Greedy
Dynamic programming
Answer: Option B.
Complete Test Series for Wipro Bag your Dream Job Today Comprehensive Online TestsInclusive Prep for All Placement ExamsAcquire Essential Domain Skills