cost = min (E(i-1, j ) ,E(i , j-i) , E(i-1,j-1) + diff(i,j))
where diff(i,j) = 0 if( a[i] == b[j])
= 1 otherwise
and E(0, i) = i and E(j,0) = j
On Tue, Jul 20, 2010 at 2:10 PM, Ashutosh Shukla <04aashut...@gmail.com>wrote:
> try it by longest common sequence.
> then interchange values .
> then delete and insert or watever..
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
