- F Quick Sort 3154 Description Given A Positive Integer Sequence No More Than 5000 Design A Function To Do Quick Sort 1 (49.01 KiB) Viewed 20 times
F. Quick Sort(3154) Description Given a positive integer sequence, no more than 5000. Design a function to do Quick sorting on it(ascending). Then print out sorted list. Take the middle of list as the pivot. Input First line enter a number(n). Second line enters n integers Output Output the sorted array. 10 number each line separated by one space. Last line maybe has less than 10 number. Examples input 复制 20 18 13 36 15 42 10 3 5 9 12 8 28 21 25 30 31 45 23 19 11 output 复制 3 5 8 9 10 11 12 13 15 18 19 21 23 25 28 30 31 36 42 45