loop through the elements of array. keep two vales firstlargest and
2ndlargest and update accordingly.
loop i=1 to n
{
if(a[i]>1stlargest)
{
2ndlargest=1stlargest;
1stlargest=a[i];
continue;
}
if(A[i]>2ndlargest)
2ndlargest=a[i];
}// loop closed
On Mon, Nov 28, 2011 at 2:16 AM, KARTHIKEYAN V.B. <kartmu...@gmail.com>wrote:
> Hi,
>
> Find the highest and second highest element in an array in O(n) time
>
> Input : arr[]={1,4,0,7,8,9}
> Output : 9 and 8
>
> Thanx in advance
>
> Regards,
> Karthikeyan
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
*
Regards*
*"The Coder"*
*"Life is a Game. The more u play, the more u win, the more u win , the
more successfully u play"*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
