list

 Lists are sequence containers that allow non-contiguous memory allocation. 

As compared to vector, list has slow traversal, but once a position has been found, insertion and deletion are quick. Normally, when we say a List, we talk about doubly linked list. 

For implementing a singly linked list, we use forward list.

-----------------

#include <iostream> 

#include <list> 

#include <iterator> 

using namespace std; 


//function for printing the elements in a list 

void showlist(list <int> g) 

{ 

list <int> :: iterator it; 

for(it = g.begin(); it != g.end(); ++it) 

cout << '\t' << *it; 

cout << '\n'; 

} 


int main() 

{ 


list <int> gqlist1, gqlist2; 



for (int i = 0; i < 10; ++i) 

{ 

gqlist1.push_back(i * 2); 

gqlist2.push_front(i * 3); 

} 

cout << "\nList 1 (gqlist1) is : "; 

showlist(gqlist1); 


cout << "\nList 2 (gqlist2) is : "; 

showlist(gqlist2); 


cout << "\ngqlist1.front() : " << gqlist1.front(); 

cout << "\ngqlist1.back() : " << gqlist1.back(); 


cout << "\ngqlist1.pop_front() : "; 

gqlist1.pop_front(); 

showlist(gqlist1); 


cout << "\ngqlist2.pop_back() : "; 

gqlist2.pop_back(); 

showlist(gqlist2); 


cout << "\ngqlist1.reverse() : "; 

gqlist1.reverse(); 

showlist(gqlist1); 


cout << "\ngqlist2.sort(): "; 

gqlist2.sort(); 

showlist(gqlist2); 


return 0; 


} 

----------O/P--------------

List 1 (gqlist1) is :     0    2    4    6    

8    10    12    14    16    18


List 2 (gqlist2) is :     27    24    21    18    

15    12    9    6    3    0


gqlist1.front() : 0

gqlist1.back() : 18

gqlist1.pop_front() :     2    4    6    8    

10    12    14    16    18


gqlist2.pop_back() :     27    24    21    18    

15    12    9    6    3


gqlist1.reverse() :     18    16    14    12    

10    8    6    4    2


gqlist2.sort():     3    6    9    12    

15    18    21    24    27

-----------------------

Comments

Post a Comment

Popular posts from this blog

Difference between Structure and Array in C

  On the basis of internal implementation following are some basic differences between both. Sr. No. Key Structure Array 1 Definition Structure can be defined as a data structure used as container which can hold variables of different types. On other hand Array is a type of data structure used as container which can hold variables of same type and do not support multiple data type variables. 2 Memory Allocation Memory allocation for input data in structure does not necessary to be in consecutive memory location. While in case of array the input data stored in contiguous memory allocation which implies that array stores data in such memory model where it assigns consecutive memory blocks (that is, memory blocks having consecutive addresses). 3 Accessibility In order to access the element in Structure we require to have the name of that element i.e it is mandatory to have element name for its retrieval from Structure. On other hand in case of Array we can access the element by index....
Read more

new operator

 new operator The new operator denotes a request for memory allocation on the Heap. If sufficient memory is available, new operator initializes the memory and returns the address of the newly allocated and initialized memory to the pointer variable. Syntax to use new operator: To allocate memory of any data type, the syntax is: pointer-variable = new data-type; Here, pointer-variable is the pointer of type data-type. Data-type could be any built-in data type including array or any user defined data types including structure and class. Example: // Pointer initialized with NULL // Then request memory for the variable int *p = NULL;  p = new int;                OR // Combine declaration of pointer  // and their assignment int *p = new int;  Initialize memory: We can also initialize the memory using new operator: pointer-variable = new data-type(value); Example: int *p = new int(25); float *q = new float(75.25); Allocate block of m...
Read more