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:
B. Can't stop things from doing wrong.
Explanation:
Life is never for certain there are so many unpredictable things that can happen like at one moment you are turning onto the street and you get into a car accident you didn't plan for that to happen. Anything can happen on a day to day basis that's why something can go wrong and all your plans won't work anymore.
Answer:
A compiled language is a programming language whose implementations are typically compilers and not interpreters. In this language, once the program is compiled it is expressed in the instructions of the target machine. There are at least two steps to get from source code to execution. While, an interpreted language is a programming language whose implementations execute instructions directly and freely, without previously compiling a program into machine-language instructions. While in this language, the instructions are not directly executed by the target machine. There is only one step to get from source code to execution.
I hope this helps.
Answer:
Check the explanation
Explanation:
// include the necessary packages
import java.io.*;
import java.util.*;
// Declare a class
public class DataReader
{
// Start the main method.
public static void main(String[] args)
{
// create the object of scanner class.
Scanner scan = new Scanner(System.in);
// Declare variables.
boolean done = false;
boolean done1 = false;
float sum = 0;
double v;
int count = 0;
// start the while loop
while (!done1)
{
// start the do while loop
do
{
// prompt the user to enter the value.
System.out.println("Value:");
// start the try block
try
{
// input number
v = scan.nextDouble();
// calculate the sum
sum = (float) (sum + v);
}
// start the catch block
catch (Exception nfe)
{
// input a character variable(\n)
String ch = scan.nextLine();
// display the statement.
System.out.println(
"Input Error. Try again.");
// count the value.
count++;
break;
}
}
// end do while loop
while (!done);
// Check whether the value of count
// greater than 2 or not.
if (count >= 2)
{
// display the statement on console.
System.out.println("Sum: " + sum);
done1 = true;
}
}
}
}
Sample Output:
Value:
12
Value:
12
Value:
ten
Input Error. Try again.
Value:
5
Value:
nine
Input Error. Try again.
Sum: 29.0
Here's a solution in node.js. Can be easily transcribed to other languages:
var paint_per_sqf = 1/350;
var wall_area = 250.0;
var gallons_paint = wall_area * paint_per_sqf;
console.log(wall_area.toFixed(1) + " square feet wall will need:");
console.log(gallons_paint.toFixed(12) + " gallons of paint");
