I\'m just practicing some MIT java assignments. But, I\'m not sure how to find the second largest number. http://ocw.csail.mit.edu/f/13
public class Marath
private static int secLargest(int[] numbers) { int maxVal = 0; int nextMaxVal = 0; for (int i = 0; i < numbers.length; i++) { if (numbers[i] > maxVal) { nextMaxVal = maxVal; maxVal = numbers[i]; } if (numbers[i] < maxVal) { nextMaxVal = maxVal; maxVal = numbers[i]; } } return nextMaxVal; }