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.

This will take a few minutes. Attention: the generated file has a size of approx. 12 GB, so make sure to have enough diskspace. If you're running the challenge with a ...

Abstract: We present a simple grammar-based compression strategy derived from the factorization used in the DC3 suffix-sorting algorithm that supports fast substring ...