fork download
copy 
  1. import java.util.*;
  2. import java.lang.*;
  3. import java.io.*;
  4.  
  5. class Main {
  6.     public static void main (String[] args) {
  7.         int numbers[] = {1, 5, -9, 12, -3, 89, 18, 23, 4, -6};
  8.  
  9.         // Find minimum (lowest) value in array
  10.         System.out.println("Minimum Value = " + getMinValue(numbers));
  11.  
  12.         // Find maximum (largest) value in array
  13.         System.out.println("Maximum Value = " + getMaxValue(numbers));
  14.  
  15.         // Calculate and print average
  16.         System.out.println("Average Value = " + getAvgValue(numbers));
  17.  
  18.         // Sort and print the array
  19.         Arrays.sort(numbers);
  20.         System.out.print("Sorted Array = ");
  21.         for (int num : numbers) {
  22.             System.out.print(num + " ");
  23.         }
  24.         System.out.println();
  25.  
  26.         // Challenge: Print the array in reverse
  27.         System.out.print("Reversed Array = ");
  28.         for (int i = numbers.length - 1; i >= 0; i--) {
  29.             System.out.print(numbers[i] + " ");
  30.         }
  31.         System.out.println();
  32.  
  33.         // Challenge: Count positive and negative numbers
  34.         countPosNeg(numbers);
  35.     }
  36.  
  37.     // Find maximum (largest) value in array
  38.     public static int getMaxValue(int[] numbers) {
  39.         int maxValue = numbers[0];
  40.         for (int i = 1; i < numbers.length; i++) {
  41.             if (numbers[i] > maxValue) {
  42.                 maxValue = numbers[i];
  43.             }
  44.         }
  45.         return maxValue;
  46.     }
  47.  
  48.     // Find minimum (lowest) value in array
  49.     public static int getMinValue(int[] numbers) {
  50.         int minValue = numbers[0];
  51.         for (int i = 1; i < numbers.length; i++) {
  52.             if (numbers[i] < minValue) {
  53.                 minValue = numbers[i];
  54.             }
  55.         }
  56.         return minValue;
  57.     }
  58.  
  59.     // Find the average of an array of integers
  60.     public static double getAvgValue(int[] numbers) {
  61.         double sum = 0;
  62.         for (int i = 0; i < numbers.length; i++) {
  63.             sum += numbers[i];
  64.         }
  65.         double average = sum / numbers.length;
  66.         return average;
  67.     }
  68.  
  69.     // Challenge: Count how many numbers are positive or negative
  70.     public static void countPosNeg(int[] numbers) {
  71.         int pos = 0, neg = 0;
  72.         for (int num : numbers) {
  73.             if (num > 0) pos++;
  74.             else if (num < 0) neg++;
  75.         }
  76.         System.out.println("Positive Count = " + pos);
  77.         System.out.println("Negative Count = " + neg);
  78.     }
  79. }
  80.  
Success #stdin #stdout 0.2s 57916KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Minimum Value = -9
Maximum Value = 89
Average Value = 13.4
Sorted Array = -9 -6 -3 1 4 5 12 18 23 89 
Reversed Array = 89 23 18 12 5 4 1 -3 -6 -9 
Positive Count = 7
Negative Count = 3
https://ideone.com/ccg5b5
language:
Java (HotSpot 12)
created:
21 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!