Insertion sort using C++ STL

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

Last Updated : 19 Mar, 2019

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}

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

sort(arr, arr + n);

CPP

// C++ program to sort Array
// using sort() in STL

#include <bits/stdc++.h>
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[0]);

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

Insertion sort using C++ STL

C

code_r

Improve

Article Tags :

Practice Tags :

Similar Reads

How to sort an array of dates in C/C++?

Given an array of dates, how to sort them. Example: Input: Date arr[] = {{20, 1, 2014}, {25, 3, 2010}, { 3, 12, 1676}, {18, 11, 1982}, {19, 4, 2015}, { 9, 7, 2015}} Output: Date arr[] = {{ 3, 12, 1676}, {18, 11, 1982}, {25, 3, 2010}, {20, 1, 2014}, {19, 4, 2015}, { 9, 7, 2015}} We strongly recommend

How to Sort a Vector in Descending Order Using STL in C++?

Sorting vector in descending order means arranging the elements in such a way that the first element will be largest, and second element will be second largest and so on.In C++, the simplest way to sort the vector in descending order is to by using the sort() function with a custom comparator.C++#in

Insertion sort using C++ STL

Implementation of Insertion Sort using STL functions. Pre-requisites : Insertion Sort, std::rotate, std::upper_bound, C++ Iterators. The idea is to use std::upper_bound to find an element making the array unsorted. Then we can rotate the unsorted part so that it ends up sorted. We can traverse the a

Sorting an array according to another array using pair in STL

We are given two arrays. We need to sort one array according to another. Examples: Input : 2 1 5 4 9 3 6 7 10 8 A B C D E F G H I JOutput : 1 2 3 4 5 6 7 8 9 10 B A F D C G H J E I Here we are sorting second array(a character array) according to the first array (an integer array).We have discussed d

Create a Sorted Array Using Binary Search

Given an array, the task is to create a new sorted array in ascending order from the elements of the given array.Examples: Input : arr[] = {2, 5, 4, 9, 8} Output : 2 4 5 8 9 Input : arr[] = {10, 45, 98, 35, 45} Output : 10 35 45 45 98 The above problem can be solved efficiently using Binary Search.

Sorting all array elements except one

Given an array, a positive integer, sort the array in ascending order such that the element at index K in the unsorted array stays unmoved and all other elements are sorted. Examples: Input : arr[] = {10, 4, 11, 7, 6, 20} k = 2; Output : arr[] = {4, 6, 11, 7, 10, 20} Input : arr[] = {30, 20, 10} k =