A Divide and Conquer based function to find the longest common prefix . This is similar to the merge sort technique
def commonPrefix ( arr , low , high ) : NEW_LINE INDENT if low == high : NEW_LINE INDENT return arr [ low ] NEW_LINE DEDENT if high > low : NEW_LINE DEDENT