Hi,

I need some suggestions on what data structure to use for the following problem:

I've a flat file having alphabets as data like:

1. asadhfklal

2. qseinqwankn

3. asekwqoepqwqerlm

.

.

.

I need to compare each line with other such that if I've:

1. the same alphabets for a position I add 5 to the match-point

2. differenet alphabets for a position I add 0 to the match-point

e.g comparing 1 and 2 will have a match-point of 10 (s and a match).

Hence for each pair of comparison I'll get a match - point.

But I don't know how many lines it may contain and how long each alphabet string may be. This is the part that's worrying me most. Being a freshie I've no clue how to handle this.

Appreciate your guidance.

Thanks,

AK