Question

JAVA Objectives: 1. Apply linear search algorithm 2. Apply select sort algorithm 3. Apply array iteration skill Problem description:

Write the following eight methods and write a main function to test these methods

// return the index of the first occurrence of key in arr

// if key is not found in arra, return -1 public static int linearSearch(int arr[], int key)

// sort the arr from least to largest by using select sort algorithm public stati void selectSort(int arr[])

// print out all array elements. 5 elements per line public static void printArray(int arr[])

// assign each element in array with a random number

// between 1 and 100, inclusive public static void initializeArray(int arr[])

// find the range of all array elements

// the range is defined as the difference between the largest and smallest elements public static int range(int arr[])

// find the largest element in array public static int largst(int arr[]) // find the smallest element in array public static int smallest(int arr[])

// find the average value of all elements in array public static double average(int arr[]) Sample pseudo code for main function

1. Declare an int array of size 10

2. Initialize the array by calling initializeArray function

3. Print out the array by calling printArray function

4. Print out the largest and smallest value of the array by using System.out.prinln and calling largest and smalles functions

5. Print out the range of the array

6. Print out the average of the array elements

7. Ask user to enter a search key

8. Call the linearSearch function with array and key. Based on result, print out appropriate message

9. Call the selectSort function to sort the array.

10. Print out array again to see the sorted array

Answer 1

Screenshot of program code:-

import java.util. Random; import java.util.Scanner; public class ArraySearchSortLargest Smallest { //Function assigns each element in array with a //random number between 1 and 100. public static void initializeArray (int arr[]) Random r = new Random(); for (int i = 0; i <10; i++) arr[i] = r.nextInt (100)+1; //Function prints out all array elements. Five elements per line public static void printArray (int arr[]) { int lineCounter = 1; for (int i = 0; i < 10; i++) System.out.print (arr[i]+" "); if((lineCounter 5)==0) System.out.println(); lineCounter = 0; lineCounter++;

//Function finds the largest element in array public static int largst (int arr[]) int max = arr[0]; for(int i=1; i<10; i++) if(arr[i]>max) max = arr[i]; return max; //Function finds the smallest element in array public static int smallest (int arr[]) int min = arr[0]; for(int i=1; i<10; i++) if(arr[i]<min) min = arr[i]; return min; //Function finds the range of all array elements. //The range is defined as the difference between the largest and smallest. public static int range (int arr[]) int large = largst(arr); int small = smallest(arr); return (large-small);

//Function finds the average value of all elements in array public static double average (int arr[]) double sum = 0; for(int i=0; i<10; i++) sum = sum + arr[i]; return (sum/10); //Function sorts the array from least to largest by using select sort. public static void select Sort(int arr[]) for(int i=0; i<10; i++) // Find the minimum element int minIndex = i; for (int i=i+1; j<10; i++) if (arr[j] < arr[minIndex]) minIndex = j; //Swap int temp = arr[minIndex]; arr[minIndex] = arr[i]; arr[i] = temp;

//Function returns the index of the first occurrence of key in array. //If key is not found in array, it returns -1. public static int linearSearch(int arr[], int key) for(int i=0; i<10; i++) if(arr[i]==key) return i; return -1; //main() method public static void main(String[] args) { //Declare an int array of size 10 int arr[] = new int[10]; Scanner scan = new Scanner(System.in); //Initialize the array by calling initializeArray function initializeArray (arr); // Print out the array by calling printArray function System.out.println("Array elements: "); printArray(arr); //Print out the largest by calling largst function System.out.println("Largest element: "+largst(arr)); //Print out the largest by calling smallest function System.out.println("Smallest element: "+smallest(arr)); //Print out the range of the array by calling range function System.out.println("Range of array: "+range (arr)); //Print out the average of the array elements by calling average function System.out.println("Average of the array elements: "+average (arr));

//Prompt & read key to be searched from user System.out.print("Enter a search key: "); int key = scan.nextInt(); //Calling linearSearch function with array and key int index = linearSearch(arr, key); //Based value returned by linearSearch function, appropriate message is printed if(index !=-1) System.out.println (key+" is found at index location "+index); else System.out.println (key+" is not found in an array"); //Calling selectSort function to sort the array. selectSort(arr); //Print out sorted array by calling printArray function System.out.println("Sorted array: "); printArray(arr);

Screenshot of output:-

Array elements: 94 87 20 48 50 46 22 28 97 61 Largest element: 97 Smallest element: 20 Range of array: 77 Average of the array elements: 55.3 Enter a search key: 50 50 is found at index location 4 Sorted array: 20 22 28 46 48 50 61 87 94 97

Program code to copy:-

import java.util.Random;
import java.util.Scanner;

public class ArraySearchSortLargestSmallest {
  
   //Function assigns each element in array with a
   //random number between 1 and 100.
   public static void initializeArray(int arr[])
   {
       Random r = new Random();
  
for (int i = 0; i < 10; i++)
arr[i] = r.nextInt(100)+1;
   }

   //Function prints out all array elements.Five elements per line
   public static void printArray(int arr[])
   {   int lineCounter = 1;
       for (int i = 0; i < 10; i++)
       {
           System.out.print(arr[i]+" ");
           if((lineCounter%5)==0)
           {
               System.out.println();
               lineCounter = 0;
           }
           lineCounter++;
       }
   }
  
   //Function finds the largest element in array
   public static int largst(int arr[])
   {
       int max = arr[0];
       for(int i=1; i<10; i++)
       {
           if(arr[i]>max)
               max = arr[i];
       }
       return max;
   }
  
   //Function finds the smallest element in array
   public static int smallest(int arr[])
   {
       int min = arr[0];
       for(int i=1; i<10; i++)
       {
           if(arr[i]<min)
               min = arr[i];
       }
       return min;
   }

   //Function finds the range of all array elements.
   //The range is defined as the difference between the largest and smallest.
   public static int range(int arr[])
   {
       int large = largst(arr);
       int small = smallest(arr);
       return (large-small);
   }

   //Function finds the average value of all elements in array
   public static double average(int arr[])
   {
       double sum = 0;
       for(int i=0; i<10; i++)
       {
           sum = sum + arr[i];
       }
       return (sum/10);
   }
     
   //Function sorts the array from least to largest by using select sort.
   public static void selectSort(int arr[])
   {
       for(int i=0; i<10; i++)
{
// Find the minimum element
int minIndex = i;
for (int j=i+1; j<10; j++)
if (arr[j] < arr[minIndex])
minIndex = j;

//Swap
int temp = arr[minIndex];
arr[minIndex] = arr[i];
arr[i] = temp;
}
   }
  
   //Function returns the index of the first occurrence of key in array.
   //If key is not found in array, it returns -1.
   public static int linearSearch(int arr[], int key)
   {
       for(int i=0; i<10; i++)
       {
           if(arr[i]==key)
               return i;
       }
       return -1;
   }
  
   //main() method
   public static void main(String[] args) {
       //Declare an int array of size 10
       int arr[] = new int[10];
       Scanner scan = new Scanner(System.in);
      
       //Initialize the array by calling initializeArray function
       initializeArray(arr);
       //Print out the array by calling printArray function
       System.out.println("Array elements: ");
       printArray(arr);
       //Print out the largest by calling largst function
       System.out.println("Largest element: "+largst(arr));
       //Print out the largest by calling smallest function
       System.out.println("Smallest element: "+smallest(arr));
       //Print out the range of the array by calling range function
       System.out.println("Range of array: "+range(arr));
       //Print out the average of the array elements by calling average function
       System.out.println("Average of the array elements: "+average(arr));
       //Prompt & read key to be searched from user
       System.out.print("Enter a search key: ");
       int key = scan.nextInt();
       //Calling linearSearch function with array and key
       int index = linearSearch(arr, key);
       //Based value returned by linearSearch function, appropriate message is printed
       if(index!=-1)
           System.out.println(key+" is found at index location "+index);
       else
           System.out.println(key+" is not found in an array");
       //Calling selectSort function to sort the array.
       selectSort(arr);
       //Print out sorted array by calling printArray function
       System.out.println("Sorted array: ");
       printArray(arr);

   }

}