[FEATURE REQUEST] Add TournamentSort Sorting Algorithm

[Harshsaini001]

What would you like to Propose?

I would like to propose adding a new sorting algorithm — Tournament Sort — in the sorts package.
Tournament Sort is a comparison-based sorting algorithm that simulates a knockout tournament structure to determine the sorted order of elements. It builds a “winner tree” to repeatedly select the smallest element until the array is sorted.

Issue details

Currently, the sorts package does not include an implementation of Tournament Sort.
This algorithm works by simulating a knockout-style tournament to repeatedly find the minimum (or maximum) element and place it in the sorted order.
Adding this implementation will enhance the repository’s completeness by including another classical comparison-based sorting algorithm that is useful in theoretical analysis and external sorting scenarios.

Additional Information

No response

[Harshsaini001]

Hi! I would like to work on this issue and add the implementation of Tournament Sort in the sorts package.
Could you please assign it to me?