Answer:
Pseudocode is as follows:
// below is a function that takes two parameters:1. An array of items 2. An integer for weight W
// it returns an array of selected items which satisfy the given condition of sum <= max sum.
function findSubset( array items[], integer W)
{
initialize:
maxSum = 0;
ansArray = [];
// take each "item" from array to create all possible combinations of arrays by comparing with "W" and // "maxSum"
start the loop:
// include item in the ansArray[]
ansArray.push(item);
// remove the item from the items[]
items.pop(item);
ansArray.push(item1);
start the while loop(sum(ansArray[]) <= W):
// exclude the element already included and start including till
if (sum(ansArray[]) > maxSum)
// if true then include item in ansArray[]
ansArray.push(item);
// update the maxSum
maxSum = sum(ansArray[items]);
else
// move to next element
continue;
end the loop;
// again make the item[] same by pushing the popped element
items.push(item);
end the loop;
return the ansArray[]
}
Explanation:
You can find example to implement the algorithm.
Because the string is invalid or your source is not attached to your search engine.
Answer and Explanation:
class Dis
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter values for a,b,c");
double a=sc.nextDouble();
double b=sc.nextDouble();
double c=sc.nextDouble();
String s=discriminant(a,b,c);
System.out.println(s);
}
public String discriminant(double a, double b, double c)
{
double result;
result=(
);
if(result<0)
return "no real solutions"";
else return "";
}
}
Note:This program is written in JAVA
Blood Alcohol Level is the other evidence for more severe penalties.
