## Return the two largest integers in an array of values

I am attempting to return the two largest integers from my int array. I am able to return the largest and the smallest fine, but I cannot get my algorithm to return the two largest. Any help is greatly appreciated here.

Please forgive any errors in my code. This is a practice session and the question has been taken from last years exam material at university.

Here is my code:

public class TwoLargestIntsArray { public static void main(String [] args){ int [] values = new int[5]; values[0] = 5; values[1] = 10; values[2] = 15; values[3] = 20; values[4] = 25; System.out.println(twoLargest(values)); System.out.println(); } public static int twoLargest(int values[]){ int largestA = values[0]; int largestB = values[0]; for(int i = 0; i < values.length; i++){ if(values[i] > largestA){ largestA = values[i]; } if(values[i] < largestA){ largestB = values[i]; } } return largestA + largestB; } }

You can write

public static int[] twoLargest(int values[]){ int largestA = Integer.MIN_VALUE, largestB = Integer.MIN_VALUE; for(int value : values) { if(value > largestA) { largestB = largestA; largestA = value; } else if (value > largestB) { largestB = value; } } return new int[] { largestA, largestB }; }

**Find the largest three elements in an array,** Given an array with all distinct elements, find the largest three elements. third = -∞ 2) Iterate through all elements of array. a) Let current array element be x. return ;. } third = first = second = Integer.MIN_VALUE;. for (i = 0 ; i < arr_size ; i ++). Output: Maximum AND Value = 4 Better Approach : Idea is based on properties of AND operator. AND operation of any two bits result in 1 iff both bits are 1. We start from the MSB and check whether we have minimum of two elements of array having set value.

public static void twoLargest(int values[]){ int largestA = values[0]; int largestB = -1; for(int i = 0; i < values.length; i++){ if(values[i] > largestA){ largestB = largestA; largestA = values[i]; } else if (values[i] > largestB && values[i] != largestA) { largestB = values[i]; } } System.out.println("Largest - " + largestA); System.out.println("2nd largest Largest - " + largestB); }

**Find Second largest element in an array,** void print2largest( int arr[], int arr_size). {. int i, first, second;. /* There should be atleast two elements */. if (arr_size < 2). {. printf ( " Invalid Input " );. return ;. }. The problem does not state whether the largest and second largest integers must be unique integers. In other words, if the largest integer in the list is 34 and it happens to appear twice, I will assume that 34 can be both the largest and second largest integers.

public class Test { public static int[] findTwoHighestDistinctValues(int[] array) { int max = Integer.MIN_VALUE; int secondMax = Integer.MIN_VALUE; for (int value:array) { if (value > max) { secondMax = max; max = value; } else if (value > secondMax && value < max) { secondMax = value; } } return new int[] { max, secondMax }; } public static void main(String []args) { int [] values = new int[5]; values[0] = 5; values[1] = 10; values[2] = 15; values[3] = 20; values[4] = 25; int []ar = findTwoHighestDistinctValues(values); System.out.println("1 = "+ar[0]); System.out.println("2 = "+ar[1]); } }

OUTPUT:

1 = 25

2 = 20

**Return the two largest integers in an array of values,** find two largest numbers in array python. I am attempting to return the two largest integers from my int array. I am able to return the largest and the smallest fine, Also, when initializing maxV in the maxArray method, you might want to use the first value of the array (double maxV = dar[0]), because if all doubles in the array are negative, maxV with the number 0 will be the highest. (You could also use the lowest double value possible by saying double maxV = Double.MIN_NORMAL).

You cannot have a single function return 2 values. You either have to wrap them in an array, or use reference parameters.

**Find first two largest elements in a given array,** Given an array of integers, write an algorithm to find the first two largest elements in the array. Example: Int [] a = { 6, 8, 1, 9, 2, 1, 10}; Output: 10, 9 Int [] a = { 6, 8, I have two different functions for trying to find the largest value in an ArrayList. I have two since i was first seeing if they would return the same value and then performance time. However they are reproducing the same value but it seems to be the last value of the ArrayList, regardless if its the largest or not.

Pass array to be filled with values:

public static void twoLargest(int [] values, int [] ret){ //... ret[0] = largestA; ret[1] = largestB; } int [] ret = new int [2]; twoLargest(values, ret); // now ret[0] is largestA // and ret[1] is largestB

**Write a program to find top two maximum numbers in a array.,** Write a program to find top two maximum numbers in a array. How to get distinct elements from an array by avoiding duplicate elements? Write a program to Find the largest pair sum in an unsorted array. Given an unsorted of distinct integers, find the largest pair sum in it. For example, the largest pair sum in {12, 34, 10, 6, 40} is 74. This problem mainly boils down to finding the largest and second largest element in array.

**Find largest and second largest elements of the array,** We can get the largest and second largest of sets of two in one comparison! So the first thing we should do is divide our array into n/2 pairs of two. Namely: The first element is assigned to the integer variable “largest”, this means that before starting of the second loop the value of largest is 19. First Iteration of second loop: 19, which is the value of “largest” variable is compared with 21, since 21 is greater than 19, the “if” condition is true and the value of largest is now 21.

**C++ Program to find second Largest element in an array,** The program then finds the second largest element of the array using for loop. for (int i = 2; i< n ; i ++) { /* If the current array element is greater than largest * then num[i]; } } cout<<"Second Largest Element in array is: "<<second; return 0; }. Tags for Biggest value in the array using pointers in C. pointers concept to find max value; maximum in array using pointers; write a program using pointer to find greatest number in array? yhsm-inucbr_001; largest of an array using pointers; maximum number in array using pointers; c program using arrays with pointers to find the largest and

**freeCodeCamp Challenge Guide: Return Largest Numbers in Arrays ,** Return Largest Numbers in Arrays Problem Explanation You will get an array that Hint 2. You can work with multidimensional arrays by Array[Index][SubIndex] Given an array of integers. Find the first and second smallest integers from an array. OR. Find two smallest numbers from an array. INPUT: 7, 6, 8, 10, 11, 5, 13, 99. OUTPUT: First Smallest is 5 and Second Smallest is 6. Method 1. TIME COMPLEXITY: O(N) SPACE COMPLEXITY: O(1) Algorithm. 1. Take two variables smallest and nextSmallest. 2.