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