Sorting is a well-known computational problem. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this paper, we propose a new comparison sorting algorithm SieveSort, based on the technique of divide-and-conquer, that takes time O(n2) in the worst-case, where n is the number of records in the given list to be sorted. This sorting algorithm could be treated as a multi-way Quicksort, which can be used to identify a desired key without sorting the entire sequence. © 2004 IEEE.