This repository has been archived by the owner on May 7, 2023. It is now read-only.
Array.sort() time complexity #83
Comments
|
Yeah, I think you're right as well. My friend told me the same thing. Feel free to submit PR if you would like to 👍 Thanks for noticing this 👍 |
|
IF this hasn't been fixed yet it shouldn't be closed. Either we close it with a fix, they close it with a fix, or we put it as 'will not fix'. Otherwise it should stay open since it has not been |
|
@skatcat31 You're right. Thanks for letting me know! 👍 |
fedemengo
added a commit
to fedemengo/30-seconds-of-interviews
that referenced
this issue
Jun 8, 2018
fedemengo
added a commit
to fedemengo/30-seconds-of-interviews
that referenced
this issue
Jun 8, 2018
|
@skatcat31 In my local commit there are two more fixes you can integrate into your last fix. See if it's fine for you. |
|
|
13 tasks
|
... I wish I had seen that before I tried to remember what base the notation was in... this really has been a long week. |
flxwu
pushed a commit
that referenced
this issue
Jun 7, 2019
Fix #83 Big O Notation: missed the time taken and the NlogN math
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Shouldn't the time complexity of
Array.sort()be O(NlogN) instead of O(logN)? Inquestions/big-o-notation.mdThe text was updated successfully, but these errors were encountered: