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.

Sign up for GitHub

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

Jump to bottom

Quick sort. #323

Open
PradeepFSTdhane123 opened this issue Oct 20, 2024 · 1 comment
Open

Quick sort. #323

PradeepFSTdhane123 opened this issue Oct 20, 2024 · 1 comment

Comments

@PradeepFSTdhane123
Copy link

Quick Sort is an efficient, recursive, and comparison-based sorting algorithm that follows the divide-and-conquer paradigm. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays, depending on whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted.
@PradeepFSTdhane123
Copy link
Author

@Vanshikapandey30 "I would love the opportunity to contribute and work on this project.
Could you please assign the issue to me? I'm eager to dive in and make a meaningful impact. Thank you for considering my request!"

@Shoaib237124 Shoaib237124 mentioned this issue Oct 28, 2024
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@PradeepFSTdhane123