Binary Quick Sort

Binary Quick Sort is a variant of Quick Sort that partitions the array based on a binary bit at a specific position, efficiently sorting integers in-place using bitwise comparisons.