Bug in finding the "Longest Increasing Subsequence"

[Markandayan1518]

Last Testcase gets fail : 0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15
a longest increasing subsequence is
0, 2, 6, 9, 11, 15. or
0, 4, 6, 9, 11, 15 or
0, 2, 6, 9, 13, 15 or
0, 4, 6, 9, 13, 15

But it return wrong answer: 0, 1, 3, 7, 11, 15

[Markandayan1518]

[phishman3579]

Thanks for this, I believe I have fixed the bug.