FilesExpand file tree

 main

/

Main.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (43 loc) · 1.61 KB

 main

/

Main.java

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (43 loc) · 1.61 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

package frequencyOfElements;

import java.util.Arrays;

/**

* @author Fatih ARI - 24.08.2021

*

* A program is designed to find the new frequencies of how many times

* the elements are repeated in a given array.

*

*/

public class Main {

public static void main(String[] args) {

clearScreen();

int[] array = {1, 7, 20, 10, 10, 5, 20, 3};

System.out.print("\nGiven Array: " + Arrays.toString(array));

Arrays.sort(array);

System.out.print("\n\nSorted Array: " + Arrays.toString(array));

int[] rep = Arrays.copyOfRange(array, 0, array.length);

//Array elements are kept in the first index,

//Frequencies are kept in the second index.

int[][] frequencies = new int[array.length][2];

int temp = 0;

for (int i = 0; i < array.length; i++) {

temp = array[i];

frequencies[i][0] = temp;

frequencies[i][1]++;

for (int j = i + 1; j < rep.length; j++) {

if (temp == rep[j])

frequencies[i][1]++;

}

i += frequencies[i][1] - 1;

}

System.out.println("\n");

for (int i = 0; i < frequencies.length; i++) {

if (frequencies[i][1] != 0)

System.out.println("The number " + frequencies[i][0] + " is repeated " + frequencies[i][1] + " times.");

}

}

// It is used for console screen cleaning in Java.

public static void clearScreen() {

System.out.print("\033[H\033[2J");

System.out.flush();

}

}