Reliably Broken Sort –

Given a list of positive integers that contains at least 3 distinct entries, output a permutation of that list that isn’t sorted in ascending or decending order.


1,2,3 -> 2,1,3 or 3,1,2

For Get Answer – Click here

Leave a Reply

Your email address will not be published. Required fields are marked *