Bibi-binary express any number, it suffices to enumerate the (hexadecimal) digits that make it up. For example: the number written as "2000" in base ten, which translates to "7D0" in conventionally-written hexadecimal, would in Bibi-binary be spoken aloud as "BIDAHO". Contrary to the numeric conventions used in modern computers, the bibi-binary system represents negative numbers using one's complement, rather than two's complement. Thus: and their sum is written as "1 1111" (one of two representations of zero in this system; zero can also be written as "0 0000"). On modern machines, in classic binary notation, −7 would be written 1 1001,
Skew binary number system into a skew binary number runs in time linear in the length of the number. Skew binary numbers find applications in skew binomial heaps, a variant of binomial heaps that support worst-case O(1) insertion, and in skew binary random access lists, a purely functional data structure. They also find use in bootstrapped skew binomial heaps, which have excellent asymptotic guarantees. If smoothsort is implemented using perfect binary trees (rather than the more common Leonardo trees), the heap is divided into trees which correspond to the digits of the skew binary representation of the heap size. Skew binary number system The