Betasort Algorithm (version 1, detailed description)

<p>A schematic specification of the betasort algorithm over the course of one trial. Rectangles refer to operations, diamonds to logical branches, and octagons to loops that iterate over sets of items. Four phase are depicted: the choice policy (red), the relaxation of the contents of memory (green), the processing of explicit feedback (blue), and implicit inference (yellow). An updated version of this figure appears in Jensen et al. (2015) "Implicit value updating explains transitive inference performance: The betasort model," PLOS Computational Biology, 11, e1004523.