Answer:
The correct answer to the following question will be "n logn".
Explanation:
- Time Complexity should be the same as the whole last particular instance, just the log base keeps changing with three.
- Throughout the circumstance of separating 2 arrays, we want one correlation. however, for splitting between 3-way arrays, will require 2 comparisons to sort.
- However, after breaking the array into 3, we can lower the number of transfers by growing the comparison. So the time complexity would then persist the same, but the log should get base 3 as we've classified into different parts.
So the time complexity will be:
⇒
⇒