Tentamen (uitwerkingen)
CS6515 - Exam 1 questions and answers 2024
- Vak
- Instelling
What is the running time for Longest Increasing Subsequence (LIS) - ANSWER-O(n^2) What is the recurrence for Longest Increasing Subsequence (LIS)? - ANSWER-L(i) = 1 + max{ L(j) | xj < xi} This reads as the answer to index I is 1 + the maximum over all j's between 1 and i where xj is less th...
[Meer zien]