Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array.

Abstract: The closest string problem that arises in both computational biology and coding theory is to find a string that minimizes the maximum Hamming distance from a given set of strings. This study ...