Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Answer: it’s network protocol
Explanation:
Answer:
import java.util.Scanner;
public class TestClock {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Enter two integer numbers");
int num1 = in.nextInt();
int num2 = in.nextInt();
int newSum=num1+10;
System.out.println("The first number is "+num1);
do{
System.out.println(newSum);
newSum +=10;
}while (newSum <=num2);
}
}
Explanation:
Using Java Programming language
- Prompt user for the two inputs and save them as num1 and num2(Using the scanner class)
- Create a new Variable newSum = num1+10
- Create a do...while loop to continually print the value of newSum, and increment it by 10 while it is less or equal to num2
