In one ofmy research papers I give a comparison-based sorting algorithm that runs in O(n log( n)). Given the existence of an (n log n) lower bound for sorting, how can this be possible? (*)