Integer (computer science) at least 32 bits on any computer. Programmers may also incorrectly assume that a pointer can be converted to an integer without loss of information, which may work on (some) 32-bit computers, but fail on 64-bit computers with 64-bit pointers and 32-bit integers. A "short integer" can represent a whole number that may take less storage, while having a smaller range, compared with a standard integer on the same machine. In C, it is denoted by short. It is required to be at least 16 bits, and is often smaller than a standard integer, but this is not required. A
Adaptive sort sorted items. In pseudo-code form, the "Straight Insertion Sort" algorithm could look something like this (array X is zero-based): The performance of this algorithm can be described in terms of the number of inversions in the input, and then will be roughly equal to , where is the number of Inversions. Using this measure of presortedness – being relative to the number of inversions – "Straight Insertion Sort" takes less time to sort the closer it is to being sorted. Other examples of adaptive sorting algorithms are adaptive heap sort, adaptive merge sort, patience sort, Shellsort, smoothsort, splaysort and Timsort.