/*Creating dynamic arrays using c++ and c function malloc Each value has a pointer to the next value : Type1(10) -> Type2(15) -> NULL | List1 Type1('e') -> Type2('h') ->NULL | Liste2 Functions : - pushFront / pushBack - popFront - print - clear - getAt - setAt */ #include #include #include using namespace std; template class Type { public: T value; Type *next=NULL; }; template class List { public: int len=0; Type *first=NULL; Type *last=NULL; ~List() { Type *actual=first; while(actual!=NULL) { Type *n=actual; actual=actual->next; free(n); n=NULL; } first=NULL; } void clear() { Type *actual=first; while(actual!=NULL) { Type *n=actual; actual=actual->next; free(n); n=NULL; } first=NULL; len=0; } void pushFront(T value) { Type *nw=(Type*)malloc(sizeof(nw)); if(nw==NULL) { cout<<"Nope"; exit(0); } if(len==0) { last=nw; } nw->next=first; first = nw; nw->value = value; len++; } void pushBack(T value) { Type *nw=(Type*)malloc(sizeof(nw)); if(nw==NULL) { cout<<"Nope"; exit(0); } if(len==0) { first=nw; } nw->next=NULL; last->next = nw; last=nw; nw->value = value; len++; } void popFront() { if(first!=NULL) { Type *t=first; if(first->next==NULL) { last=first; } first=first->next; free(t); t=NULL; len--; } } T getAt(int pos) { if(pos>len||pos<0||first==NULL) { exit(0); } int i=0; Type *actual=first; while(inext; i++; } T *ptr=(T*)(actual->value); return actual->value; } T operator[](int pos) { return getAt(pos); } void operator+=(T value) { pushBack(value); } void setAt(int pos, T value) { if(pos>len||pos<0||first==NULL) { exit(0); } int i=0; Type *actual=first; while(inext; i++; } actual->value=value; actual=NULL; } void insert(int pos, T value) { if(pos>len||pos<0||first==NULL) { exit(0); } Type *nw=(Type*)malloc(sizeof(nw)); if(nw==NULL) { exit(0); } Type *actual=first; int i=0; while(inext; i++; } nw->next=actual->next; actual->next=nw; nw->value=value; len++; } void print() { Type *actual=first; while(actual!=NULL) { cout<value<<" -> "; actual=actual->next; } actual=NULL; cout<<"NULL"< liste; liste.pushFront(1); //add a new integer in 1st position liste.print(); //print each member of the array liste.pushFront(2); //add a new integer in 1st position liste.pushBack(3); liste.print(); liste.setAt(1, 5);//change value at array[1] liste.print(); liste.popFront(); //delete first integer of the array liste.print(); liste.pushFront(4); liste.insert(1, 6); liste.print(); std::cout<<"liste[1]="< liste2; liste2.pushFront('h'); liste2.print(); liste2.pushFront('e'); liste2.print(); cout<

linked list using dynamic memory allocation