For a sorted array a[] of length n and a value x, you must return both: If either does not exist, output -1 in its place. Here’s the [Problem Link] to begin with. a (sorted) x Floor Ceil [1, 2, 8, 10, 11, 12, 19] 0 -1 1 [1, 2, 8, 10, 11, 12, 19] … Continue reading Ceil The Floor | Binary Search Implementation