✍ Scribed by Koichiro Shida; Shin'ichi Yamada
No coin nor oath required. For personal study only.
For N-body simulations, event-list is used to store timing information about potential interactions between pairs of N particles. We reported that the number of entry of the list can be reduced much smaller than the number of potential interactions and the reduction improves performance of simulation. Small list can be handled easily using array structure. In this article, we reimplement the method with an array, instead of complex tree, and find that the optimal number of entry is about N. We can save large amount of memory instead of little cpu time,
📜 SIMILAR VOLUMES