No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
i got the code for this problem but not able to find where i am wrong my problem is as follows Given an array of numbers, find the longest subsequence whose elements grow monotonically: 1 4 8 2 5 7 3 6 => 1 4 5 7 1 4 8 …
|
|
|
i got the code for this problem but not able to find where i am wrong my problem is as follows Given an array of numbers, find the longest subsequence whose elements grow monotonically: 1 4 8 2 5 7 3 6 => 1 4 5 7 1 4 8 … 
|
|
|
Can someone tell me how the series is to be implemented in c 1,1,1 2,1 2 3,1 2 3 4 5, 1 2 3 4 5 6 7 8 here is my code but i am not able to get the answer [code] #include<stdio.h> int i,n1=0,n2=1,n3,n; void main() { printf("\n … 
|