0 votes 0 votes A list of n strings, each of length n, is sorted into lexicographic order using merge - sort algorithm. The worst case running time of this computation is: $O (n \log n)$ $O (n^{2} \log n)$ $O (n^{2}+\log n)$ $O(n^{3})$ Unknown Category ugcnetcse-nov2017-paper2 + – Arjun asked Nov 5, 2017 • edited Nov 7, 2017 by makhdoom ghaya Arjun 812 views answer comment Share Follow See 1 comment See all 1 1 comment reply Rishabh Gupta 2 commented Nov 7, 2017 reply Follow Share https://gateoverflow.in/1762/gate2012_39 0 votes 0 votes Please log in or register to add a comment.