Answer:
answer:
#include <iostream>
#include<list>
using namespace std;
bool Greater(int x) { return x>3; } int main() { list<int>l; /*Declare the list of integers*/ l.push_back(5); l.push_back(6); /*Insert 5 and 6 at the end of list*/ l.push_front(1); l.push_front(2); /*Insert 1 and 2 in front of the list*/ list<int>::iterator it = l.begin(); advance(it, 2); l.insert(it, 4); /*Insert 4 at position 3*/ for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " "; /*Display the list*/ cout<<endl; l.erase(it); /*Delete the element 4 inserted at position 3*/ for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " "; /*Display the list*/ cout<<endl;
l.remove_if(Greater); for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " ";
/*Display the list*/
cout<<endl; return 0;
}
1. Horsing around can lead to breaking equipment in the classroom or somebody getting hurt
2. leaving your backpack on the floor can cause someone to fall
3.something unexpected may happen and worsen the problem
4. it can corrupt the computer's files and deleted unsaved work.
if you want the sentences to be longer, add some words to them and make the message the same.
Answer:
one, because the consumers of news are no longer interested in worlwide events, but rather on events that are happening close to them, and in a form affect them directly, and second, because it is cheaper to cover gossip, and it generates more profitability for media broadcasters, than speaking about events that have no impact on people´s interests.
In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
Another important advantage would be that the information you stored is portable and you may thus carry the CD right inside your pocket. Whenever you need it, you can retrieve it in a minute.
