In Java Find the second largest and second smallest element in a given array. You can...

In Java

Find the second largest and second smallest element in a given array. You can hardcode/declare the array in your program.

Solutions

Expert Solution

```
import java.util.Scanner;
```
```
public class SecondLargest_Smallest
```
```
{
```

    public static void main(String[] args)

```
    {
```
```
        int n, temp;
```

        Scanner s = new Scanner(System.in);

        System.out.print("Enter no. of elements you want in array(Minimum 2):");

```
        n = s.nextInt();
```
```
        int a[] = new int[n];
```

        System.out.println("Enter all the elements:");

```
        for (int i = 0; i < n; i++) 
```
```
        {
```
```
            a[i] = s.nextInt();
```
```
        }
```
```
        for (int i = 0; i < n; i++) 
```
```
        {
```

            for (int j = i + 1; j < n; j++)

```
            {
```
```
                if (a[i] > a[j]) 
```
```
                {
```
```
                    temp = a[i];
```
```
                    a[i] = a[j];
```
```
                    a[j] = temp;
```
```
                }
```
```
            }
```
```
        }
```

        System.out.println("Second Largest:"+a[n-2]);

        System.out.println("Smallest:"+a[0]);

```
    }
```
```
}
```

venereology answered 1 year ago

Next > < Previous

Related Solutions

Given an array of numbers, find the index of the smallest array element (the pivot), for...

Given an array of numbers, find the index of the smallest array element (the pivot), for which the sums of all elements to the left and to the right are equal. The array may not be reordered. Example arr=[1,2,3,4,6] the sum of the first three elements, 1+2+3=6. The value of the last element is 6. Using zero based indexing, arr[3]=4 is the pivot between the two subarrays. The index of the pivot is 3. Function Description Complete the function balancedSum...

Using Java Write a method that returns the index of the smallest element in an array...

Using Java Write a method that returns the index of the smallest element in an array of integers. If the number of such elements is greater than 1, return the smallest index. Use the following header: public static int indexOfSmallestElement (double[] array)

Write a Java method that returns the index of the largest element in an array of...

Write a Java method that returns the index of the largest element in an array of integers. If the number of such elements is greater than 1, return the smallest index. Use the following header:   public static int indexOfLargestElement(double[] array)  Write a test program that prompts the user to enter ten numbers, invokes this method to return the index of the largest element, and displays the index.

In Java Please: * posOfLargestElementLtOeT returns the position of the largest element in the array that...

In Java Please: * posOfLargestElementLtOeT returns the position of the largest element in the array that is * less than or equal to the limit parameter * if all values are greater than theVal, return -1; * * Precondition: the array is nonempty and all elements are unique. * Your solution must go through the array exactly once. * * <pre> * 0 == posOfLargestElementLtOeT(3, new double[] { -7 }) // value:-7 is in pos 0 * 5 == posOfLargestElementLtOeT(3,...

Question 6 Which of the following for loops will find the largest element in the array...

Question 6 Which of the following for loops will find the largest element in the array numbers, assuming numbers has already been assigned a collection of numeric values? Question 6 options: largest = None for i in range(len(numbers)): if largest is None and numbers[i] > largest: largest = numbers[i] largest = None for i in range(numbers): if largest is None and numbers[i] > largest: largest = numbers[i] largest = None for i in range(len(numbers)): if largest is None or numbers[i]...

How would you take a given array of non-repeating random integers and sort every 5th element. Meaning index 0 is the smallest element in the array.

JAVA ProgrammingHow would you take a given array of non-repeating random integers and sort every 5th element. Meaning index 0 is the smallest element in the array. index 4 is the 5th smallest element in the array, index 9 is the 10th smallest element in the array and so on...- this array could be small (like 5 indexes) or large (like 100,000 indexes).- all other numbers do not change position

write a method that returns the index of the second smallest element in an array of integers. If the number of such elements is greater than 1.

write a method that returns the index of the second smallest element in an array of integers. If the number of such elements is greater than 1. return the second smallest index. Use the following header:public static int index of seconds sma11eststenent tint array

Use C Programming - Given an array of integers and a number K, find the smallest...

Use C Programming - Given an array of integers and a number K, find the smallest element in array greater than or equal to K. If such element exists in the array, display it otherwise display "-1". Example: Input: 8 1 3 4 7 8 9 9 10 5 where: First line represents the number of elements in the array. Second line represents the elements in the array. Third line represents the value of K. Output: 7 Explanation:...

implement in LEGV8 find the smallest value in an array.

Consider the following algorithm to find the kth largest elementof a given array A of...

Consider the following algorithm to find the kth largest element of a given array A of n numbers. We pick every fifth element of A and place them in the array B. We find the median of B recursively, and use this median of B as a pivot to partition the array A. Depending on k and the number of elements that are smaller than the chosen pivot, we recurse into an appropriate subproblem of A.Answer the following questions.Write the...

Subjects