Comment Comment by hyc_symas Ah yes, you're absolutely right. O(N log N) because there are log N chunks to be merged.O(N log N) is still untenable in the long run, nobody has exponentially growing compute resources. parent hyc_symas 11 years ago
O(N log N) is still untenable in the long run, nobody has exponentially growing compute resources.