Add Tournament Sort implementation

[drori12]

Description of Change

Added Tournament Sort algorithm implementation in C. Tournament Sort improves
upon naive Selection Sort by using a min-heap to find the minimum element in
O(log n) instead of O(n), achieving O(n log n) overall time complexity.

References

https://en.wikipedia.org/wiki/Tournament_sort

Checklist

• Added description of change
• Added file name matches File name guidelines
• Added tests and example, test must pass
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

Notes: Tournament Sort implementation with 6 test cases covering unsorted, sorted, reverse sorted, single element, duplicates, and negative numbers.

[github-actions]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.