Longest Common Subsequence by Dynamic Programming

CSC-325 · Semester V · Design and Analysis of Algorithms

Array ADT
0
12
1
79
2
23
3
96
4
26
5
64
6
85
7
94
8
98
9
80

Length

10

Comparisons

0

Writes

0

Index access is O(1) — that is why arrays beat lists for random reads. But inserting at the front shifts every element, costing O(n). Try inserting at index 0.