Sorting in construction of resolutions of combinatorial designs

There are different kinds of sorting algorithms. Each algorithm has its own advantages and disadvantages depending on the data they process. We are interested in the performance of sorting algorithms in the case of construction of resolutions of combinatorial designs. Studying their performance for this special class of problems will give us the opportunity to improve, if possible, the speed of our software for solving similar problems. We use C++ and, for part of our investigations, the computer algebra system GAP.