time-complexity

Struggling to Optimize a Recursive Algorithm's Time Complexity Beyond O(n log n) - Any Brilliant Ideas?

I'm working on a complex graph traversal problem where my current recursive solution consistently lands at O(n log n). I'm positive a linear O(n) approach exists, but every attempt...