Dealing with the data is the basic task of almost every computer application. When we want to manipulate data sets then it is always easy to do that with sorted data sets. Today’s computer applications are dealing with big data sets and sorting these big data sets is a tedious job. It will take more computing time even by using best comparison sorting techniques like Merge sort, Quick sort or Heap sort which takes O (n log n) computing time. In this paper, author would like to propose a special type of sorting algorithm ‘SLinearSort’ which sorts the large integer data sets in linear computing time.