Merge sort best & average case O(n)?

[sfdye]

https://github.com/TheAlgorithms/Python/blob/master/README.md#merge
Shouldn't it be O(n log n).

The Java repo is correct though:
https://github.com/TheAlgorithms/Java#merge

[pandyamarut]

it's O(n log n ) only.

[hasangokdag]

#342 I changed the readme and created a pull request

[vishkothari96]

It is O(n*log(n)) for best, average and worst case.
Where, n:size of the array under consideration.

[sumitkumar22299]

Yes! It should be O(n*log(n)) for every case i.e. best case, average case, worst case.

[hasangokdag]

Are you pointing out that there should be a "" between n and log(n)?
like O(n log(n)) vs O(nlog(n))?

In readme file Merge, Quick and Shell is also using one space as multiplication instead of "*". Thats why I also used it that way in the PR.

[sfdye]

@hasangokdag No. In the master, best & average are O(n) which are simply incorrect and misleading.

[piyush01123]

Hi @sfdye , @hasangokdag has corrected precisely what you are saying in his commit. Look at his commit: ce3e678
But his PR is still open, please be patient and let the repo owners merge his PR.

[sfdye]

@piyush-kgp Yeah I am aware of the PR. It should get high priority as this simple typo could fail someone's interview.

[piyush01123]

Yes. you are right. Just noticed that this thread is 9 days old. Apologies.

[AnshulMalik]

Thanks @hasangokdag

[sfdye]

Finally this is merged. Cheers 👍