quick sort

Can someone explain how this works and how can i do the exact process for this array [7,-3,12,5,-1,5,0,16,9,7] since there is same numbers in this list im confused about it I also didnt understand in this process there is p q j and r. In the videos i have watched on youtube there is only i and j. The picture i sent is from khan academy and this is the format i will be having in the exam so im tryna understand it. Thank you for the responses
No description
4 Replies
JavaBot
JavaBot7mo ago
This post has been reserved for your question.
Hey @viperr! Please use /close or the Close Post button above when your problem is solved. Please remember to follow the help guidelines. This post will be automatically marked as dormant after 300 minutes of inactivity.
TIP: Narrow down your issue to simple and precise questions to maximize the chance that others will reply in here.
dan1st
dan1st7mo ago
QuickSort only needs a single comparison operation. If it compares elements to the pivot, it an just always treat the same element as smaller, always treat it as bigger or just leave the element as is pretty much depending on your exact implementation
JavaBot
JavaBot7mo ago
💤 Post marked as dormant
This post has been inactive for over 300 minutes, thus, it has been archived. If your question was not answered yet, feel free to re-open this post or create a new one. In case your post is not getting any attention, you can try to use /help ping. Warning: abusing this will result in moderative actions taken against you.
JavaBot
JavaBot7mo ago
Post Closed
This post has been closed by <@487009039822225439>.

Did you find this page helpful?