Yes Edit Distance is Most Efficient Algorithms Implemented So far and we all know this :P , but Sukran is saying Trie ? seems odd initially but let me analyze it ,Seems Good to me but we need to store length of strings in advance so that while inserting in trie wherever 1st mismatch occurs , we can just subtract current index from length of matching sting isn't it ? for map & man assume map is already in trie , when we try to insert man in try mismatch occurs at index 2 & length of "man" is 3 so number of steps required to convert is 1only
Time Complexity for both search & insert both are constant using Trie O(K) where K is length of String which is again constant its an approach , may contains bug , let me know if missed something? Shashank Mani Computer Science Birla Institute of Technology,Mesra -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/-ecPCKH4egcJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
