Program to find the second largest number in a given set of numbers using arrays without sorting?

Answer 1

Improved Solution to this problem would be able to find any first, second, third.. largest number...

here it is, in Java:

class Sam {

public static void main(String args[]) {

int[] nums = new int[] { 445, 43, 1045, 110, 209, 109, 33, 24, 1566 };

int cnt = 0;

int size = nums.length;

int temp;

int largest = 0;

int secondLargest = 0;

int thirdLargest = 0;

int fourthLargest = 0;

int fifthLargest = 0;

//the logic rests here

while (cnt < size) {

temp = nums[cnt];

if (temp > largest) {

secondLargest = largest;

largest = temp;

} else if (temp > secondLargest) {

thirdLargest = secondLargest;

secondLargest = temp;

} else if (temp > thirdLargest) {

fourthLargest = thirdLargest;

thirdLargest = temp;

} else if (temp > fourthLargest) {

fifthLargest = fourthLargest;

fourthLargest = temp;

} else if (temp > fifthLargest) {

fifthLargest = temp;

}

cnt++;

}

System.out.println("largest:" + largest);

System.out.println("secondLargest:" + secondLargest);

System.out.println("thirdLargest:" + thirdLargest);

System.out.println("fourthLargest:" + fourthLargest);

System.out.println("fifthLargest:" + fifthLargest);

}

}

// Regards,

// SwapniM

// mail me at: swap.masane@gmail.com

#include

using std::cin;

using std::cout;

using std::endl;

double maxFirst(const double data[], intindex);

double maxSecond(const double data[], intindex, double maxNumber1);

double sum(double max1, double max2);

int main()

{

double myArray[] = {

1.0,

4.6,

32.1,

9.7,

41.2,

41.3,

343,

23,

566.02,

345.8,

675.5,

654.4

};

int arraySize = (sizeof myArray)/(sizeof myArray[0]);

cout << "Your array is: ";

for (int k = 0; k < arraySize; k++)

{

cout << endl << myArray[k];

}

double max1 = maxFirst(myArray, arraySize);

double max2 = maxSecond(myArray, arraySize, max1);

cout << endl << "First biggest number is: " << max1;

cout << endl << "Second biggest number is: " << max2;

system("PAUSE");

return 0;

}

double maxFirst(const double data[], intindex)

{

double maxNumber1 = data[0];

for (int i = 0; i < index; i++)

{

if (maxNumber1 < data[i])

{

maxNumber1 = data[i];

}

}

return maxNumber1;

}

double maxSecond(const double data[], intindex, double maxNumber1)

{

double maxNumber2 = data[1];

for (int j = 0; j < index; j++)

{

if (data[j] == maxNumber1)

{

continue;

}

else if (maxNumber2 < data[j])

{

maxNumber2 = data[j];

}

}

return maxNumber2;

}

Answer 2

Because you can't use built in PHP functions to sort the array, you need to loop through the array and find the second largest number.