If there are n2 entries in edit distance matrix then each entry-05662
If there are Θ (n2) entries in edit distance matrix then each entry E (i, j) takes __________ time to compute.
This multiple choice question (MCQ) is related to the book/course
vu cs502 Fundamentals of Algorithms.
It can also be found in
vu cs502 Final Term - Quiz No.2.
If there are Θ (n2) entries in edit distance matrix then each entry E (i, j) takes __________ time to compute.
Θ (n)
Θ (n2)
Θ (1)
Θ (n log n)
