In algorithms, what is the big-O time complexity of merge sort?
Answer
O(nlogn)
^^ you are reducing the input size by half on each recursion cycle (so logn), and on each merge you are iterating through whole list (so n) so n*logn
Question
In algorithms, what is the big-O time complexity of merge sort?
Answer
?
Question
In algorithms, what is the big-O time complexity of merge sort?
Answer
O(nlogn)
^^ you are reducing the input size by half on each recursion cycle (so logn), and on each merge you are iterating through whole list (so n) so n*logn
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p95
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.