README.md - Quicksort average case performance

[antfitch]

Readme says average case performance for quicksort is 0(n^2), but elsewhere, this is O(n log n).
https://en.wikipedia.org/wiki/Quicksort

Is this a bug in the docs? Or is average case performance for the version of quicksort in this repo actually O(n^2)?

[harshildarji]

I hope that screenshot below will clear your doubts:

If you have any improved script for QuickSort, Your contribution is welcomed.

[antfitch]

Hello harshildarji, my comment was for average case, not best case. Average case is usually O(n log n) not O(n^2) for this alg.

[harshildarji]

@antfitch My bad, I’ll check and correct it within next 24 hours (or you can just do a PR with the corrections, I’ll immediately merge it).

[antfitch]

No worries and cool. I added a PR.

[harshildarji]

@antfitch Done!