The bookshelf problem (which computer scientists call the “list labeling” problem) is one of the most basic topics in the field of data structures. “It’s the kind of problem you’d teach to freshman or ...

In our paper we investigate the k-ary Algorithm for finding GCD of long natural numbers. We suggest an effective modification for the Algorithm which gives an essential acceleration for the whole ...