The main purpose of this project is to compare a new sorting method- Meansort with its preceding sorting method- Quicksort. Meansort uses the mean value for each key to determine the partition of the file, but Quicksort selects at random. Experiments proved that in some ways Meansort is superior to Quicksort but is still not perfect since it always needs a mean value for each key. This project implements these two methods and determines the situations under which each of these methods outperforms the other.