How many times is the complexity of the improved sorts less than the complexity of the simple ones?

Question

Algorithms

I have searched a lot of material on the topic, but have not found an answer.
"Simple sorts have complexity on the order of N^2, while advanced sorting algorithms have a total complexity of about N*logN."
From this, it is also not clear how many times the complexity of the improved is less than the complexity of the simple one.

Answer 1

Um... N * N / (N * log N) = N / log N times, obviously.