Adding Quick sort

[anishhh238]

Quicksort is a sorting algorithm based on the divide and conquer approach where

• An array is divided into subarrays by selecting a pivot element (element selected from the array).

  While dividing the array, the pivot element should be positioned in such a way that elements less than pivot are kept on the left side and elements greater than pivot are on the right side of the pivot.

• The left and right subarrays are also divided using the same approach. This process continues until each subarray contains a single element.
• At this point, elements are already sorted. Finally, elements are combined to form a sorted array.

[b19149]

done

[Shahnawazkhan83]

I want to add code for Quicksort in C++ for hacktoberfest 2022. Please assign this issue to me.

[Yashasvi-b]

Hi please assign this issue to me. I want to contribute to hacktoberfest 2022

[prateekpr17]

Hi there 👋

I'm excited to contribute to Hacktoberfest 2023, and I'd like to work on this issue. It looks like a great opportunity to learn and contribute to the project.

Please assign this issue to me, and I'll start working on it right away. If you have any specific instructions or guidelines, please let me know, and I'll make sure to follow them.

Thanks a lot for considering my request!

Best regards, Prateek Sethi

[SONUKUMARRAM145]

hello sir this is my first hactoberfest and started my journey as a open source contributor can u pls assign this issue it will boost my spirit for open source thankyou

[saku1331]

I wish to contribute. Kindly assign this to me.

[devvkumar]

Please assign this issue to me.