APFIVE Merge Sort Algorithm Properties
All of the following statements concerning the merge sort algorithm are true EXCEPT:
A
Merge sort then merges the sorted subarrays to produce a fully sorted array.
B
Merge sort generally has a time complexity of O(n log n) in all cases.
C
Merge sort divides the array into smaller subarrays to sort them individually.
D
Merge sort is an iterative algorithm that does not use recursion.
Question Leaderboard
| Rank | |||||
|---|---|---|---|---|---|
| #1 | kazvin.tjakradinata | 1 | 1 | 0m 11s | 89 |
| #2 | kshiva2009m | 1 | 1 | 0m 15s | 85 |
| #3 | singhris000 | 1 | 1 | 0m 22s | 78 |
| #4 | vempaami000 | 1 | 1 | 0m 27s | 73 |
| #5 | sathilak000 | 1 | 1 | 0m 33s | 67 |
| #6 | winstonhou1107 | 1 | 1 | 0m 35s | 65 |
| #7 | y.seong2027 | 1 | 1 | 0m 49s | 51 |
| #8 | tfvhygdj | 1 | 2 | 1m 38s | -8 |
| #9 | jayanthsai.kadimpati.7 | 0 | 1 | 0m 02s | -12 |
| #10 | suhanakochhar006 | 1 | 3 | 2m 36s | -76 |
Items per page:
10
1 – 10 of 13