Combinatorial number system 601 and 1010001011 = 651, which again shows that "C" comes before "C"<nowiki>'</nowiki>. This number is not however the one one wants to represent the "k"-combination with, since many binary numbers have a number of raised bits different from "k"; one wants to find the relative position of "C" in the ordered list of (only) "k"-combinations. The number associated in the combinatorial number system of degree "k" to a "k"-combination "C" is the number of "k"-combinations strictly less than "C" in the given ordering. This number can be computed from "C" = { "c", ..., "c", "c" } with "c"
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