This paper shows advantages of the proposed strategies with the three major simple and inefficient algorithms selection sort, bubble sort, and insertion sort, representing three broad classes selection, exchange and insertion based sorting algorithms. Other popular sorting algorithms such as the quick sort, the heap sort and shell sort from these categories have the potentiality to be improved by using the proposed approaches. These methods and the mentioned algorithms deserve future research.