//sort(arr(address of first element),arr+n(adress after last element )) //sort function takes O(n logn) time complexity //The algorithm used by sort() is IntroSort // Introsort being a hybrid sorting ...