Increasing Efficiency of Replacing Selection Algorithm using back to back Dual Heaps For Sorting n numbers We always required n memory spaces but with the replacement we can use less memory sizes and generating number of sorted lists and we can apply merge sorting later one.