Skip to content

Instantly share code, notes, and snippets.

Created November 24, 2012 16:36
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save anonymous/4140421 to your computer and use it in GitHub Desktop.
Save anonymous/4140421 to your computer and use it in GitHub Desktop.
package utilities;
import java.util.Scanner;
public class SalesComputations {
static int salespeople;
static int sum;
static int sales[];
static double average;
public static double computeAverage(int[] sales) {
int sum = getTotalSales(sales);
if (sales.length !=0) {
return (double) sum/sales.length;
}
return Double.MIN_VALUE;
}
public static int findMin(int[] sales){
int min = sales[0];
int who = 0;
for (int i=0; i < sales.length; i++)
{
if (min > sales[i])
{
min = sales[i];
who = i;
}
}
return who;
}
public static int findMax(int[] sales){
int max = sales[0];
int who = 0;
for (int i=0; i < sales.length; i++)
{
if (max < sales[i])
{
max = sales[i];
who = i;
}
}
return who;
}
public static int newValue(int[] sales, Scanner scan) {
int valueToCompareAgainst = scan.nextInt();
findLargerSales(valueToCompareAgainst, sales);
return valueToCompareAgainst;
}
public static int[] findLargerSales(int valueToCompareAgainst, int[] sales) {
for (int i=0; i < sales.length; i++)
{
if (sales[i] > valueToCompareAgainst)
{
salespeople = sales[i];
}
}
return sales;
}
public static int getTotalSales(int[] sales) {
sum = 0;
for (int i=0; i < sales.length; i++)
{
sum = sum + sales[i];
}
return sum;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment