For bitwidth=32, the resource consumption for different max sort number is listed in the following table:
| Max_sort_number | 8 | 16 | 32 | 64 | 128 | 256 | 512 |
| Interval | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| LUT | 343 | 607 | 1135 | 2144 | 4192 | 8285 | 16477 |
| Register | 1007 | 1835 | 3451 | 6692 | 13156 | 26082 | 51885 |
Insert Sort primitive sets 1024 as the default maximum sort number. To achieve an arbitrary sort number, first the input stream will be sorted every 1024 number by the Insert Sort primitive, then use the Merge Sort primitive to merge the sorted stream (see reference Internals of Merge Sort). The following figure shows the synthesis result for the maximum sort number of 1024.