Talk:Quicksort

message: I am thinking about adding the section on Quick Sort's uses in various fields. While the Quick Sort article provides a comprehensive explanation of the algorithm, it could benefit from more real-world examples of how Quick Sort is used in different domains. For instance, the article could discuss how Quick Sort is used in data processing, image processing , or network analysis, and how it compares to other sorting algorithms in these contexts. This could help readers gain a better understanding of the practical applications of Quick Sort and strengthen it and weaknesses in different settings. Wpengda (talk) 23:34, 12 March 2023 (UTC)
replies: text: Please don't. Applications sections generally turn into spam magnets - long lists of unhelpful trivia. MrOllie (talk) 23:41, 12 March 2023 (UTC)
replies: text: Got you. Wpengda (talk) 02:09, 15 March 2023 (UTC)
thread_title:  More examples of Quick Sort in practice 

message: Hello, I am thinking about adding the section on Quick Sort's recent research. While the Quick Sort article gives people the view of the quick sort algorithm, we can update some new findings to it to make it stay up to the new research. For example, when changing the pick of pivots will improve the worst case of time complexity from O(N^2) to O(NlogN). MiaoQiQi (talk) 20:55, 14 March 2023 (UTC)
replies: text: Given the formulaic nature of these talk page sections, I assume that you folks are participating in some sort of class. Please direct your instructor to Wikipedia:Education program for best practices for this kind of activity. MrOllie (talk) 20:59, 14 March 2023 (UTC)

text: The cited article does not provide any proof about the worst case complexity of the proposed algorithm. By looking at the algorithm it is hard to believe that the worst case is n lg n. The algorithm simply avoids taking the lowest or highest value as pivot. Gilles Falquet (talk) 23:38, 20 March 2023 (UTC)
replies: text: I agree, this is just a conference paper and covering it here is likely WP:UNDUE. I'll remove it. MrOllie (talk) 16:44, 23 March 2023 (UTC)
thread_title:  More recent research on Quick Sort 

message: The animated demonstration of Quicksort using Hoare's partition scheme seems to have one element sorted to its correct position after each partition routine and then omit it in the following recursions. Yet the pseudocode below claims that after one partition the pivot is then included in the next recursive call, which means no element should be omitted. Also the content below the pseudocode writes "In this scheme, the pivot's final location is not necessarily at the index that is returned, as the pivot and elements equal to the pivot can end up anywhere within the partition after a partition step, and may not be sorted until the base case of a partition with a single element is reached via recursion." My question is that is there a mismatch between the code and the animated demonstration (i.e. the demo is another scheme of quicksort)? (There is also a great chance that I have overlooked some details and misunderstood the material.) Student118 (talk) 06:27, 11 September 2023 (UTC)
thread_title:  Is there a mismatch between the animated demo and the pseudocode of Hoare's partition scheme?