divide the input array into thirds (rather than halves), recursively sort each third, and finally combine the results using a th
1 answer:
Answer:
The answer is "nlogn".
Explanation:
- The time complexity can only shift to 3 with the last instance. For the 2nd case, they need one parallel. However, 2 parallels are needed to sort with splitting into 3-way frames.
- It decreases the number of passes even after breaking the collection in 3 by increasing contrast. So, the time complexity remains the same but the log is divided into 3 bits.
- The complexity of time is:
You might be interested in
Answer:
Explanation:
The following is written in Java and prints out the pattern to and from the first num parameter that is passed to the function. Meaning it goes from num1 to 0 and then from 0 to num1 again. It prints all of the values in a single line seperated by a space and a test case was used using the values provided in the question. The output can be seen in the attached picture below.
static void printNumPattern(int n1,int n2){
System.out.print(n1 + " ");
if(n1<=0) {
return;
} else {
printNumPattern(n1-n2,n2);
}
System.out.print(n1 + " ");
}
