STL에서 정렬 컨테이너를 구현하는 C++ 프로그램

이 C++ 프로그램에서는 STL에서 컨테이너 정렬을 구현합니다.

기능 및 설명:

Functions used here:
   l.push_back() = It is used to push elements into a list from the front.
   l.sort() = Sorts the elements of the list.
   Where l is a list object.

예시 코드

#include <iostream>
#include <list>
#include <string>
#include <cstdlib>
using namespace std;
int main() {
   list<int> l;
   list<int>::iterator it;
   int c, i;
   while (1) {
      cout<<"1.Insert Element to the list"<<endl;
      cout<<"2.Display the List"<<endl;
      cout<<"3.Exit"<<endl;
      cout<<"Enter your Choice: ";
      cin>>c;
      switch(c) {
         case 1:
            cout<<"Enter value to be inserted";
            cin>>i;
            l.push_back(i);
         break;
         case 2:
            l.sort();
            cout<<"Elements of the List: ";
            for (it = l.begin(); it != l.end(); it++)
               cout<<*it<<" ";
            cout<<endl;
         break;
         case 3:
            exit(1);
         break;
         default:
            cout<<"Wrong Choice"<<endl;
      }
   }
   return 0;
}

출력

1.Insert Element to the list
2.Display the List
3.Exit

Enter your Choice: 1
Enter value to be inserted7
1.Insert Element to the list
2.Display the List
3.Exit

Enter your Choice: 1
Enter value to be inserted10
1.Insert Element to the list
2.Display the List
3.Exit

Enter your Choice: 1
Enter value to be inserted6
1.Insert Element to the list
2.Display the List
3.Exit

Enter your Choice: 1
Enter value to be inserted4
1.Insert Element to the list
2.Display the List
3.Exit

Enter your Choice: 2
Elements of the List: 4 6 7 10
1.Insert Element to the list
2.Display the List
3.Exit
Enter your Choice: 3

Exit code: 1