A new technique has been introduced for sorting a large number of data set. Technique is known as Forest sort. It comprises of 3 steps- (1) a forest of binary trees has been made using hashing (2) In order traversal of each tree has been carried out concurrently (3) Merge sort has been applied to the resulting lists in (2) in a concurrent manner. A comparison has also been made with Quick Sort and in order Binary Sort. Results have proved that the performance of forest sort is far better.
