Improving the performance of the algorithm for distributing numerics by ranges

Abstract

The paper considers an accelerated algorithm for distributing numbers over given ranges. The proposed algorithm allows you to quickly distribute integers over predetermined ranges with deterministic boundaries and calculate the number of elements in each of the ranges. If the number of ranges lies in the range from 64 to 256, then the time for solving the problem will be reduced by 9–33 times. The algorithm can be implemented in both software and hardware.