Jump to content

Daou

New Members
  • Posts

    1
  • Joined

  • Last visited

Daou's Achievements

Lepton

Lepton (1/13)

0

Reputation

  1. For the string correction problem, we are given 2 strings X and Y with a parameter k and asked whether X can be turned into Y by at most k edit operations. Assume that allowed operations are (i) deleting a simple character and (ii) swapping 2 consecutive characters. Give an algorithm that solve the problem in O(2^k n ) where n is the length of X.(java)
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.