Based on the analysis of choice-sorting algorithm,we find an efficient sorting method that can reduce the original sorting time.Using this method,after every sorting,we can find the largest and the smallest datum respectively among the collection of data elements to be sorted;then again sort the remained data by uses of this method until all the data become order.