draft by oneself 8 An integer in reverse order , Draw a heap sort algorithm to put it in front of the positive order 3 Step , An example is given to analyze the stability of the algorithm ; If the data scale n Very small , Such as n=5, What sort algorithm would you choose ？ Tell me your reasons .
