Question

I am having an Array of String of 10 elements.
Now I need to compare my value available in any of these Arrays value.

1 Option I thought of sorting the array and then binary search on the
same

But further analysis, I found the value needed to be compare is not exactly same, it contains some value , but even in that case, it should be successful.

Like Value to compare ,

String str = "Author"
String[] arrays = {"@Author","@Auth",@Au...}

str.contains(arrays..) actually but how to do the same .

Answer 1

you could use Dynamic Programming:

http://www.algorithmist.com/index.php/Longest_Common_Subsequence

this algorithm check the longest subsequence of string with the minimum complex

This is the algor in java:

http://introcs.cs.princeton.edu/java/96optimization/LCS.java.html