finding the largest ascending subsequence..
write a function called
int max_set(int arr[], int size, …………)
which gets an array of integers
and returns the length of the longest ascending subsequence.
you cant use loops or external functions.
you can add arguments to the signature.
for example:
for this array
arr = 45 1 21 3 33 6 53 9 18
we can have these subsequences.
45 53
1 21 33 53
1 3 33 53
1 3 6 53
1 3 6 9 18
1 33 53
1 6 53
1 6 9 18
1 53
1 9 18
1 18
21 33 53
…….
but the longest is
1 3 6 9 18
so it needs to return 5
i dont know what the algorithm here
i dont know where to start
??