Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Apprendre Introduction to Standard Template Library | Introduction to Standard Template Library
С++ STL
course content

Contenu du cours

С++ STL

С++ STL

Introduction to Standard Template Library

book
Introduction to Standard Template Library

Whether you want to sort, filter, or transform a range of data using lists, dynamic arrays, or static arrays, you can accomplish all of this with the STL in just a few lines of code. The STL not only simplifies complex data manipulations but also improves the efficiency of your code. By learning built-in algorithms and data structures, you can focus on solving problems rather than worrying about implementation details.

with_STL.cpp

with_STL.cpp

without_STL.cpp

without_STL.cpp

copy

              
12345678910111213

            
#include <iostream>
#include <vector>
#include <algorithm>

int main()
{
    std::vector<int> numbers = { 5, 2, 8, 1, 4 };
    std::sort(numbers.begin(), numbers.end());
    std::transform(numbers.begin(), numbers.end(), numbers.begin(), [](int n) {
        return n * 2;
    });
    for (const int& n : numbers) std::cout << n << " ";
}
question mark

Start the course?

Select the correct answer

Tout était clair ?

Comment pouvons-nous l'améliorer ?

Merci pour vos commentaires !

Section 1. Chapitre 1

Demandez à l'IA

expand

Demandez à l'IA

ChatGPT

Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion

course content

Contenu du cours

С++ STL

С++ STL

Introduction to Standard Template Library

book
Introduction to Standard Template Library

Whether you want to sort, filter, or transform a range of data using lists, dynamic arrays, or static arrays, you can accomplish all of this with the STL in just a few lines of code. The STL not only simplifies complex data manipulations but also improves the efficiency of your code. By learning built-in algorithms and data structures, you can focus on solving problems rather than worrying about implementation details.

with_STL.cpp

with_STL.cpp

without_STL.cpp

without_STL.cpp

copy

              
12345678910111213

            
#include <iostream>
#include <vector>
#include <algorithm>

int main()
{
    std::vector<int> numbers = { 5, 2, 8, 1, 4 };
    std::sort(numbers.begin(), numbers.end());
    std::transform(numbers.begin(), numbers.end(), numbers.begin(), [](int n) {
        return n * 2;
    });
    for (const int& n : numbers) std::cout << n << " ";
}
question mark

Start the course?

Select the correct answer

Tout était clair ?

Comment pouvons-nous l'améliorer ?

Merci pour vos commentaires !

Section 1. Chapitre 1
some-alt