I want to add the divide and conquer algorithm for finding ith smallest element with linear time complexity(median of medians method)

[ahinagangopadhyay]

Detailed description

I want to add a divide and conquer algo to find ith smallest element in a list of numbers with linear time complexity.

Context

This is a very efficient algo to find the ith smallest(or largest)element when the search space is large.

Possible implementation

No response

Additional information

Please assign me this issue under Hacktoberfest 2024.

[github-actions]

This issue 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.