We have observed that although the logic behind quick sort is quite simple and straight-forward, people do find it a bit difficult to implement. So we have implemented this very useful and efficient (O(n*log2n)) sort in java. It has been tested for all cases, yet if you find any flaws in it, please leave a comment.
The logic behind this quick sort implementation is picked up from CLRS 3rd edition.
The logic behind this quick sort implementation is picked up from CLRS 3rd edition.
No comments:
Post a Comment