Couple sort

Computer systems and applications deal with numerous cases which require rearrangement of certain entities either in ascending or descending order. The operation required to perform this task is called Sorting. The sole purpose of designing new algorithms is to reduce the number of computations and time taken to perform a particular sort. Also there are cases where an algorithm is best suitable than the others and in some cases it is not. A sorting algorithm comprises of comparison, swapping, and assignment operations. Algorithms like bubble sort and insertion sort are easy to follow and understand but considered inferior to some other algorithms because of their worst case time complexity of O(n
²
). This paper presents a new algorithm for sorting namely Couple Sort. It is a hybrid sorting algorithm which is influenced from quick sort and bubble sort techniques which results in a considerably lower time complexity by eliminating some useless comparisons.