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