Efficient in comparison to other Quadratic Sort (i.e O(n2)) like Bubble Sort or Insertion Sort. Efficient for data set that are already sorted. Time Complexity ( i.e O(n)) Not change relative order of elements which are already sorted. Space Complexity (i.e O(1)) Disadvantage Selection...