is there a sorting algorithm of order $\log n!$
By Stirling's approximation, $$\log(n!) = n\log n - n + O(\log n) = \Theta(n\log n)\,,$$
so, yes, there are lots of sorting algorithms that run in time $O(\log(n!))$.