-
-
Notifications
You must be signed in to change notification settings - Fork 7.3k
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
Conversation
dont forget to add hactoberfest label |
Update Quickselect for Finding the k-th Smallest Element.cpp
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.
Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>
Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>
This pull request 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. |
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. 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! |
Description of Change
Checklist
Notes: