We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
I want to add a divide and conquer algo to find ith smallest element in a list of numbers with linear time complexity.
This is a very efficient algo to find the ith smallest(or largest)element when the search space is large.
No response
Please assign me this issue under Hacktoberfest 2024.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
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.
The text was updated successfully, but these errors were encountered: