Information System, BINUS 2017

Buatlah Program untuk menginput 10 angka ( 1-50 )
Lalu hitunglah frekuensi angka yang muncul

Contoh :

Input : 1,5,5,3,1,2,2,2,9,11

Output :

Angka 1 muncul 2 kali
Angka 5 muncul 2 kali
Angka 3 muncul 1 kali
Angka 2 muncul 3 kali
Angka 9 muncul 1 kali
Angka 11 muncul 1 kali

Kumpulkan tanggal 13 Mei 2014 di Kelas

/*
Kelompok Praktikum Algo 32PHM:
Henry Cander    1701293603
Luciana Melvina    1701297141
Merissa Edwina    1701298610
Rizky Fitriandini    1701292790
*/

import java.util.*;

public class Frekuensi {

public static void main(String[] args) {
String data;
String Temp = null;
String result = null;
String Dat;

int[] Total = new int[10];
int[][] Frekuensi = new int[10][2];
int Index;
int Count;
int Unique;
int TotalInput;
int CountU;

Index = 0;
Count = 0;
Unique = 10;

Scanner scan = new Scanner (System.in);

System.out.print(“Masukkan angka: “);
data = scan.nextLine();

while (Index < data.length() && Count < 10 )
{
Dat = Character.toString(data.charAt(Index));
if (Dat.equals(“,”))
{
Count++;
Temp = null;
}
else
{
if (Temp == null)
{
Temp = Dat;
Total[Count] = Integer.parseInt(Temp);
}
else
{
Temp = Temp + Dat;
Total[Count] = Integer.parseInt(Temp);
}
}
Index++;
}
if (Count >= 10)
{
TotalInput = 9;
}
else
{
TotalInput = Count;
}
for (Count = 0; Count <= 9;Count ++)
{
Frekuensi[Count][1] = 0;
}
Frekuensi[0][0] = Total[0];
Frekuensi[0][1] = 1;
Unique = 1;
CountU = 0;
for (Count = 1; Count <= TotalInput;Count ++)
{
while (Total[Count] != Frekuensi[CountU][0] && CountU < Unique)
{
CountU++;
}
if (Total[Count] == Frekuensi[CountU][0])
{
Frekuensi[CountU][1]++;
CountU=0;
}
else
if (CountU >= Unique)
{
Frekuensi[CountU][0] = Total[Count];
Frekuensi[CountU][1]++;
CountU=0;
Unique++;
}
}
for (Count = 0; Count < Unique;Count ++)
{
if (Frekuensi[Count][0] >= 1 && Frekuensi[Count][0] <= 50)
{
if (result == null)
{
result = “Angka “+Frekuensi[Count][0]+” telah muncul “+Frekuensi[Count][1]+” kali\n”;
}
else
{
result = result + “Angka “+Frekuensi[Count][0]+” telah muncul “+Frekuensi[Count][1]+” kali\n”;
}
}
}

System.out.println(result);
}
}