○三河賢治（新潟大）・田中　賢（神奈川大）

In this article, we consider a linear time generation of random derangements. Recently, we were the first to propose an exact linear time algorithm for this problem. Our approach was to generate a random derangement encoded in cycle notation and decode the encoded derangement to its original form. However, our algorithm took twice as long to generate one derangement, because of including its decoding time. In this article, we propose a fast linear time algorithm for generating random derangements. We improve Martinez’s algorithm to remove unnecessary loops and achieve an exact linear time generation of random derangements without encoded.