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:
Draw a flowchart that solve the problem of calculating the Area of circle
Pie x r x2
Explanation:
<span>public static int methodName(int a, int b){
a = a * 2;
b = b * 2;
}
</span><span>int result = doubling(5, 10<span>);
System.out.println(result);
//result would be 10, 20</span></span>
Incorrect data can lead to unexpected program execution results. Data entry errors can be reduced by only accepting valid input, e.g., if a number must be entered, alphabetic characters are ignored. After data validation, error messages can be prompted to the user, requiring him to enter the data again.
