Skip to content
New issue

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

Create Quickselect for Finding the k-th Smallest Element.cpp #2820

Open
wants to merge 10 commits into
base: master
Choose a base branch
from

Conversation

dev-priyanshu15
Copy link

@dev-priyanshu15 dev-priyanshu15 commented Oct 12, 2024

Description of Change

Checklist

  • Added description of change
  • Added file name matches File name guidelines
  • Added tests and example, test must pass
  • Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
  • 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:

@dev-priyanshu15
Copy link
Author

dont forget to add hactoberfest label

Summary of the Code
** Partition Function: Splits the array and returns the pivot index.
** QuickSelect Function: Uses the partition function recursively to find the k-th smallest element.
** Test Function: Contains test cases using assert() to verify the correctness of the quickSelect function.
** Main Function: Runs tests and uses the quickSelect function to find the k-th smallest element from the input vector.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants