Sorting-Algorithms icon indicating copy to clipboard operation
Sorting-Algorithms copied to clipboard

Published 20 hours ago • verified publisher icon diptangsu

Optimised QuickSort

Open suraj0223 opened this issue 4 years ago • 2 comments

The two way partition Quick Sort have a worst case complexity of O(n^2) when there is duplicates element in the list. This can be optimised by 3 way partition. In this all the element left of pivot element is small while the centered elements are equal to pivot element and right portion of list contain greater than pivot element.

suraj0223 avatar Sep 30 '20 20:09 suraj0223

I would like to work in Java. Please assign this to me. Thanks!

AnkitJuyal009 avatar Oct 01 '20 03:10 AnkitJuyal009

Please assign this to me, I can optimize Quick Sort Algorithm using Python

yashpaddalwar avatar Oct 16 '22 09:10 yashpaddalwar