Sorting refers to arranging data in a particular format. In this paper three modifications for the selection sort algorithm are presented. The modifications are mainly based on the programming methodologies used. In the first algorithm smallest and biggest element are found out in a single loop and exchanging first element with the smallest and last element with the biggest. This is repeated for all the elements. In the second algorithm first smallest and second smallest element are found out in a single loop and these values are moved as the first two elements. This is repeated for the rest of the elements. In the third algorithm first biggest and second biggest element are found out in a single loop and these are carried to the last positions. This is repeated for the remaining elements. The advantages of the modifications are then analyzed.