The primary purpose of this project is to compare two new non-comparison sorting algorithms: Groupsort and Flashsort 1. To simplify discussion, we focus on the performance of these algorithms with integer data. First, we test Groupsort and Flashsort1 against bucket sort using uniformly distributed integer values with a number of different additional storage spaces and give run time performance curves. Then, we test Groupsort and Flashsortl against Quicksort using different distributed input data and give run time perfomance curves. Through the analysis of impact of run time, additional storage space, and data distribution, an optimal method is given to make each algorithm perform well.