title: Is Levenshtein distance algorithm performs better than Needleman Wunsch Algorithm?
body: <p>I know that both Levenshtein and Needleman Wunsch has the time complexity of O(N*M) but I was curious to know which one performs better than the other and why?</p>