Sort a vector

Read first Task 39

std::sort puts the items in order.

Definition and example

Sort a vector is the focus of this lesson. std::sort puts the items in order. The task asks you to apply that idea in a small example: After sort(fees.begin(), fees.end()), where is the smallest value. Before you run the code, predict what should happen. Then Inspect the program output and the compiler message if it fails and compare it with your prediction. If the result differs, change one relevant line and run it again. Testing one change at a time makes the cause of a result easier to understand.

C++ 1 automatic check Section 4 · Collections and data

Code editor Ctrl + Enter runs

// TASK sort-a-vector-09: After sort(fees.begin(), fees.end()), where is the smallest value?
// STEPS: Read the explanation. Change one relevant line at a time, then run the code and compare the result with the check on the right.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<int> fees{15000, 9000, 20000};
    sort(fees.begin(), fees.end());
    // TODO: produce the required output for this task.
    cout << fees[2] << endl;
    return 0;
}

Run your code to see the output and the checks.

Your result

Submit your code to see results

Write your code in the middle column and press Run code.

Checks on this task:

The program output must match “9000 20000”.

The task and step-by-step instructions are written as comments at the top of the editor. Change one relevant line, run it, and compare the result with these checks.

Incorrect attempts before answer: 0 / 3

Track progress

0 passed of 56 tasks

Pass every check or use one of your available skips to open the next task.

← Previous

Next task (pass every check first)

Sort a vector

Sort a vector

Why this works