Answer:
The program is as follows:
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
list <int> myList;
for(int i=0;i<100;i++){
myList.push_back(rand()%100); }
list <int> :: iterator it;
cout<<"Forward: ";
for(it = myList.begin(); it != myList.end(); ++it){
cout <<*it<<" "; }
cout<<"\nReversed: ";
std::copy(myList.rbegin(),myList.rend(),std::ostream_iterator<int>(std::cout, " "));
myList.sort();
cout<<"\nSorted: ";
for(it = myList.begin(); it != myList.end(); ++it){
cout <<*it<<" "; }
return 0;
}
Explanation:
This declares the list
list <int> myList;
The following iteration generates 100 random integers into the list
<em> for(int i=0;i<100;i++){ </em>
<em> myList.push_back(rand()%100); }
</em>
This initializes an iterator
list <int> :: iterator it;
This prints the header "Forward"
cout<<"Forward: ";
This iterates through the list and prints it in order
<em> for(it = myList.begin(); it != myList.end(); ++it){
</em>
<em> cout <<*it<<" "; }
</em>
This prints the header "Reversed"
cout<<"\nReversed: ";
This uses ostream_iterator to print the reversed list
std::copy(myList.rbegin(),myList.rend(),std::ostream_iterator<int>(std::cout, " "));
This sorts the list in ascending order
myList.sort();
This prints the header "Reversed"
cout<<"\nSorted: ";
This iterates through the sorted list and prints it in order
for(it = myList.begin(); it != myList.end(); ++it){
cout <<*it<<" "; }
