Answer:
skin care personal care
Explanation:
just search up what line of business in l orea
Answer:
See Explaination
Explanation:
package testscores;
import java.util.ArrayList;
import java.util.List;
public class TestScores {
public List<Integer> scorearray=new ArrayList<>();
public TestScores(List<Integer> scores) throws InvalidTestScore{
this.scorearray=scores;
for(int i=0;i<scorearray.size();i++){
if(scorearray.get(i)>100 || scorearray.get(i)<0){
throw new InvalidTestScore(this.scorearray.get(i));
}
}
}
public double average(){
int tot=0;
for(int i=0;i<this.scorearray.size();i++){
tot=tot+this.scorearray.get(i);
}
return tot*(1.0)/(this.scorearray.size());
}
class InvalidTestScore extends Exception
{
private double amount;
public InvalidTestScore(int Score)
{
System.out.println("Invalid Score "+Score);
}
}
}
Answer:
I believe the answer is exclusive but im not 100% sure
Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
