3 ms·
Wouldn't you at least be looking at nlog(n) for the sort in the merge join?
by mountainreason 4y ago
Wouldn't you at least be looking at nlog(n) for the sort in the merge join?
- School-Cotton 4y agoYes, if the data is not already sorted. Thus it's O(n) for already sorted data and O(n log(n) + n) -- which simplifies to O(n log(n)) -- for arbitrary data.
- mountainreason 4y agoYeah. I know. Why would the data already be sorted?
- School-Cotton 4y agoIn a database you might have already built an index on that data.