//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 ...

// 0. In C++ STL we have sort function which can sort in increasing and decreasing order. // 1. Not only integral but user defind data can be sorted using this function. // 2. Internally it uses ...