Single Element in a Sorted Array

Given a sorted array where every element appears exactly twice except for one that appears once, find that single element in O(log n) time and O(1) space by using binary search that exploits pair alignment (index parity) to locate the half containing the singleton.