Questions tagged [quick-sort]
Quicksort is a sorting algorithm invented by C. A. R. Hoare that has an average-case complexity of O(n log n), worst-case complexity of O(n^2). It is one of the fastest general-purpose sorting algorithms in practice.
171 questions
0
votes
3
answers
222
views
C# quicksort implementation (LeetCode Sort an Array)
I implemented quick sort after merge sort as part of LeetCode question for sorting an array. The solution code can be found at https://leetcode.com/problems/sort-an-array/solutions/7180269/i-...
4
votes
1
answer
340
views
c++ quicksort pivots
Is this code for quicksort using the first index as a pivot correct?
Also if I want to use the last or middle index as a pivot how would the whole code change?
...
- 41
3
votes
1
answer
98
views
Creating Worst-Case Scenario for QuickSort using Middle Pivot in Java
I've implemented a solution to generate the worst-case scenario for QuickSort using the middle pivot strategy in Java. The goal is to rearrange an input array to produce the worst performance during ...
- 31
4
votes
4
answers
1k
views
Quick Sort Done Lucidly
I've been away from Programming and the Tech Industry for sometime. I thought I'd look at and try some of the older basic stuff. I bushed up to QuickSort and found most existing implementations of it, ...
3
votes
3
answers
209
views
In-place recursive quick sort in C
Here's my second program in C, and my time/space analysis of this code.
I have been reading Modern C and I attempted this challenge on page 26. The prior pages are pretty much the only exposure I have ...
- 151
2
votes
2
answers
225
views
Quick Sort Program
Quick sort is a sorting algorithm in which we select any random element as pivot from the array and we do the partition of the array around that pivot. Basically we place all the elements smaller than ...
1
vote
1
answer
182
views
K-Way Partitioning QuickSort
I have implemented the K-Way Partitioning algorithm which is based on the Peter Taylor's solution.
Which works but i want fill the q array which is the borders of ...
user268847
3
votes
1
answer
383
views
High performance 3 Way Quick Sort Implementation
My implementation of 3 way quick sort for strings.
It supposed to sort very large set of 800,000,000 objects.
This is why I added ...
- 1,656
3
votes
0
answers
139
views
Destructive quick and merge sort
I've implemented a destructive merge and quick sort in common lisp, but the code feels verbose and highly imperative. I was wondering if anyone could offer guidance on idioms that could make the code ...
- 131
2
votes
1
answer
788
views
non recursive quick sort in c++
I'm relatively new to c++ programming. I have a few years of experience writing simple Arduino programs, but I always kept to the basics. I also have some more experience with Python.
I set myself the ...
- 121
5
votes
2
answers
278
views
Case-insensitive sort in C
I wrote a sorting program so that if the optional argument -i is present then the sorting should be done without taking into account lowercase / uppercase letters.
...
- 319
1
vote
1
answer
2k
views
In place QuickSort algorithm in Python
I have been searching for ways to make my algorithm more efficient but most answers told me to divide the array into two differente arrays one of less elements and one of greater elements and then ...
- 13
0
votes
1
answer
73
views
Quicksort Invariant and steps to determine correcteness
I am having trouble with applying to 3 steps needed to proof correctness, most likely because I did not formally study CS or Mathematics and am still learning about loop and class invariants. The ...
- 61
3
votes
1
answer
1k
views
Quicksort using generics in java
The goal is to have a function that can sort a series of all object types that implement the comparable interface. I'm not trying to improve the performance of the sort. I'm only trying to optimize my ...
- 131
3
votes
2
answers
190
views
Recursive quick sort in python
I was wondering if there is anything that I could do to make my code look cleaner and more descriptive for educational purposes?
...
- 133