In this paper a comparative study of the time complexity of two “fast” algorithms for projecting a point onto the standard simplex is presented. Methods of Maculan-de Paula and Malozemov-Pevnyi, as well as two modifications of Malozemov-Pevnyi are considered. From the results of numerical experiments we can conclude that one of presented modifications of Malozemov-Pevnyi algorithm is practical.