How qbasic or fortran works for tournament sort?

Tournament sort is a comparison-based sorting algorithm that organizes elements into a binary tree structure, where each node represents a match between two elements. In QBASIC or FORTRAN, this can be implemented by recursively dividing the list into pairs, comparing them, and building a sorted array based on the winners of each match. The algorithm continues until all elements are compared and sorted. The efficiency of tournament sort lies in its ability to minimize the number of comparisons by leveraging a tree structure to systematically eliminate elements.