Given a list of integers n, we have to find the length of largest
zigazg subsequence in the list.... i.e,zigzag subsequence is defined
as "if the first number is increasing then the 2nd one should be
decreasing or vice versa...... "
for eg : if list[n]={1,10,5,9,8,12,20} then,
largest zigzag subsequence will be : {1,10,5,9,8,12} or
{1,10,5,9,8,20} and length will be=6;
--
--
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
