Binary search works by assuming the array's middle contains the array's median value.
If it is not sorted, this assumption does not make sense since the median can be anywhere and cutting the array in half could mean that you cut off the number you were searching for.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence