The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time.
['Jesun Sahariar Firoz', 'Masud Hasan', 'Ashik Zinnat Khan', 'M. Sohel Rahman']
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time.