# How to sort an Array using STL in C++?

Given an array arr[], sort this array using STL in C++.

Example:

```Input: arr[] = {1, 45, 54, 71, 76, 12}
Output: {1, 12, 45, 54, 71, 76}

Input: arr[] = {1, 7, 5, 4, 6, 12}
Output: {1, 4, 5, 6, 7, 12}
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: Sorting can be done with the help of sort() function provided in STL.

Syntax:

```sort(arr, arr + n);
```

 `// C++ program to sort Array ` `// using sort() in STL ` ` `  `#include ` `using` `namespace` `std; ` ` `  `int` `main() ` `{ ` ` `  `    ``// Get the array ` `    ``int` `arr[] = { 1, 45, 54, 71, 76, 12 }; ` ` `  `    ``// Find the size of the array ` `    ``int` `n = ``sizeof``(arr) / ``sizeof``(arr); ` ` `  `    ``// Print the array ` `    ``cout << ``"Array: "``; ` `    ``for` `(``int` `i = 0; i < n; i++) ` `        ``cout << arr[i] << ``" "``; ` `    ``cout << endl; ` ` `  `    ``// Sort the array ` `    ``sort(arr, arr + n); ` ` `  `    ``// Print the sorted array ` `    ``cout << ``"Sorted Array: "``; ` `    ``for` `(``int` `i = 0; i < n; i++) ` `        ``cout << arr[i] << ``" "``; ` `    ``cout << endl; ` ` `  `    ``return` `0; ` `} `

Output:

```Array: 1 45 54 71 76 12
Sorted Array: 1 12 45 54 71 76
```

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.