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

Question

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

ahinagangopadhyay opened this issue a year ago · 2 comments

ahinagangopadhyay commented a year ago

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.

Answer 1 · 2024-11-07T00:13:08.000Z

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.

Answer 2 · 2024-12-11T00:14:33.000Z

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!