Create a function that accepts an array of integers and finds second largest element from that array. Ex. If arr1 = {1,2,3,4} Then getSecondLargestNumber(arr1) -> 3
Sigiloso
Keep two pointers checking for the largest element and second largest element simultaneously in a single loop, Logic: if(arr[i] > largest) { slargest = largest; largest = arr[i]; } else if (arr[i) < largest && arr[i] > slargest) { slargest = arr[i]; }