Engineers· 32-bit
Simple sorts need about n² steps; clever ones need n log n. Big-O notation names the difference.
Binary search needs sorted data, so sorting is one of the most studied problems in computing. There are dozens of methods. They all produce the same sorted list. What differs, enormously, is how much work they do on the way.