feat: add quick select algorithm using median of medians

[Nothinormuch]

Description of Change

This Pull Request adds the Quick Select algorithm using the median of medians approach. Unlike the standard Quick Select algorithm which has a worst-case time complexity of O(n^2) depending on pivot selection, this implementation uses the median of medians technique to guarantee a "good" pivot. This ensures a worst-case time complexity of O(n), making it highly efficient for finding the kth largest element in an array.

References

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: Implemented a linear-time selection algorithm using median-of-medians for optimal pivot selection and O(n) worst-case performance.