We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
A few days back I was reading an argument about how constructing a Suffix Tree, despite being O(N) in worst case, has a large constant factor which can be costlier than the O(N.log^2(N)) Suffix Array method. So yeah, I agree with you when you talk about the difference between theory and practice!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Pairs
You are viewing a single comment's thread. Return to all comments →
A few days back I was reading an argument about how constructing a Suffix Tree, despite being O(N) in worst case, has a large constant factor which can be costlier than the O(N.log^2(N)) Suffix Array method. So yeah, I agree with you when you talk about the difference between theory and practice!