Direct insertion sort in disordered number is inserted into the orderly looking for a position, is after one numerical comparison can obtain the appropriate location, could you improve?

CodePudding user response:

Binary tree, is exactly what you want to improve,