说明：  no intro
(1. Prepared by the following principles of non-recursive algorithm for fast row: (1) After a trip to sort, if the sequence has been ordered (no exchange), not to participate in order, otherwise the first sub-sequence of shorter length sort, and will Another sequence of upper and lower stack saved (2) if the number of records to be ranked ? 3, then no longer be divided, but a direct comparison sort. Test Case: {49 3,865,977,613,274,988 21 105})