Longest Common Subsequence by Dynamic Programming

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

Array ADT
0
32
1
47
2
87
3
66
4
79
5
89
6
11
7
20
8
41
9
20

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.