However, in models of computer arithmetic that allow numbers to be sorted more quickly than " O " ( " n " log " n " ) time, for instance by using integer sorting algorithms, planar convex hulls can also be computed more quickly : the Graham scan algorithm for convex hulls consists of a single sorting step followed by a linear amount of additional work.
12.
For both types of sequences, the last bit is flipped and an implicit-1 should be added directly below the MSB . When the + 1 from the two's complement negation for p7 in bit position 0 ( LSB ) and all the-1's in bit columns 7 through 14 ( where each of the MSBs are located ) are added together, they can be simplified to the single 1 that " magically " is floating out to the left . For an explanation and proof of why flipping the MSB saves us the sign extension, see a computer arithmetic book.
