Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merge sort space is O(n) not O(1) #18

Open
rszymula opened this issue Apr 4, 2021 · 2 comments
Open

Merge sort space is O(n) not O(1) #18

rszymula opened this issue Apr 4, 2021 · 2 comments

Comments

@rszymula
Copy link

rszymula commented Apr 4, 2021

Need to update merge sort space complexity to O(n)

It was odd to me that merge sort stats here are "better" than quick sort in every way - whereas Quicksort is used everywhere in practice, not Mergesort.

Why is QuickSort favourable over MergeSort in practice?
https://www.reddit.com/r/computerscience/comments/6krpz7/why_is_quicksort_favourable_over_mergesort_in/

Quicksort is used bc is has better space complexity than merge. Merge should be O(n)

Screen Shot 2021-04-04 at 8 39 07 AM

@sharifsonic
Copy link

just noticed the same. PLease update

@tsiege
Copy link
Owner

tsiege commented Apr 9, 2022

Happy to accept pull requests

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants