Question

In Java

2. Array Exercise ( 10 points) Write a Java program that will prompt the user to input a size of an array. Create an array of type int. Ask a user to fill the array. Create a functions sortArray() and mostFrequency(). The sortArray() function will sort number into incrementing order. The sorting function must be implemented from scratch and it must not use any function from the library. Feel free to use any sorting algorithm. The program will display the smallest and greatest of those values. It also displays the value that occurs the most.

Answer 1

Answer 1) The java Code for the above question is below:

import java.util.Scanner;
public class Main
{
   public static void main(String[] args) {
       Scanner sc =new Scanner(System.in);
       System.out.println("Enter the Size of array");
       int size = sc.nextInt();
      
       int [] arr = new int[size];
      
       System.out.println("Enter the Array elements:");
       for(int i=0; i<size; i++){
       arr[i]= sc.nextInt();
       }
      
       sortArray(arr);
       System.out.print("Sorted Array: ");
           for(int i=0; i<size; i++){
       System.out.print(arr[i]+" ");
       }
      
       int frequentElement = mostFrequent(arr);
       System.out.println("\nMost Frequent Element is: "+ frequentElement);
   }
  
   // sortArray() function which uses Bubble sort Algorithm to sort the elements.
   public static void sortArray(int arr[])
{
   for (int i = 0; i < arr.length; i++)
{
   for (int j = 0; j < (arr.length - 1 - i); j++)
{
   //if left value is great than right value
   if (arr[j] > arr[j + 1])
{
   //swap values
    int temp = arr[j];
   arr[j] = arr[j + 1];
   arr[j + 1] = temp;
}
}
}
}
// mostFrequent() method which returns most frequency element in array.
public static int mostFrequent(int arr[])
{
// find the max frequency using linear traversal
int max_count = 1, res = arr[0], curr_count = 1;
for (int i = 1; i < arr.length; i++) {
if (arr[i] == arr[i - 1])
curr_count++;
else {
if (curr_count > max_count) {
max_count = curr_count;
res = arr[i - 1];
}
curr_count = 1; }
}
// If last element is most frequent
if (curr_count > max_count)
{
max_count = curr_count;
res = arr[arr.length - 1];
}
return res;
}
}

CODE SCREENSHOT

1 6 9 } Main.java import java.util.Scanner; 2 public class Main 3- { 4 public static void main(String[] args) { 5 Scanner sc =new Scanner(System.in); System.out.println("Enter the size of array"); 7 int size = sc.nextInt(); 8 int [] arr = new int[size]; 10 11 System.out.println("Enter the Array elements:"); 12 for(int i=0; i< size; i++){ 13 arr[i]= sc.nextInt(); 14 15 16 sortArray(arr); 17 System.out.print("Sorted Array: "); 18 for(int i=0; i<size; i++){ 19 System.out.print(arr[i]+" "); 20 21 22 int frequentElement = mostFrequent(arr); 23 System.out.println("\nMost Frequent Element is: "+ frequentElement); 24 25 26 // sortArray() function which uses Bubble sort Algorithm to sort the elements. 27 public static void sortArray(int arr[]) 28 29 for (int i = @; i < arr.length; i++) 30 31 for (int j = @; j < (arr.length - 1 - i); j++) 32 33 //if left value is great than right value 34 if (arr[j] > arr[j + 1]) 35 36 //swap values 37 int temp = arr[j]; } } { { { {

arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } // most Frequent() method which returns most frequency element in array. public static int mostFrequent(int arr[]) || { 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 } 67 68 // find the max frequency using linear traversal int max_count = 1, res = arr[@], curr_count = 1; for (int i = 1; i < arr.length; i++) { if (arr[i] == arr[i - 1]) curr_count++; else { if (curr_count > max_count) { max_count curr_count; res = arr[i - 1]; } curr_count = 1; } } // If last element is most frequent if (curr_count > max_count) { max_count = curr_count; res = arr[arr.length - 1]; } return res; }

OUTPUT SCREENSHOT

Enter the size of array 5 Enter the Array elements: 8 2 1 3 2 Sorted Array: 1 2 2 3 8 Most Frequent Element is: 2 ...Program finished with exit code 0 Press ENTER to exit console. I

Enter the Size of array 4 Enter the Array elements: 10 90 40 10 Sorted Array: 10 10 40 90 Most Frequent Element is: 10 - ..Program finished with exit code 0 Press ENTER to exit console.