Stack is a logical data structure, its implementation in physical memory being made by using other data structures.The components of the stack data structure have the same data type, which means that the stack is a homogeneous data structure.There are two basic operations with stack: adding and removal of an item.Manner of implementation for operations […]
Tag: Date
How to: Implement Arithmetic of Pointers in C++
In C++ programming language, memory areas can be accessed indirectly through pointer type variable […]. Also, available with a memory address, it ensures movement on memory areas from the memory address stored in the variable pointer. This is ensured by arithmetic operators and it is called arithmetic of pointers. Depending on the nature of arithmetic […]
How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List
The storage structures for sparse matrixes are presented at […].The simply linked list is a linear data structure, formed by elements called nodes. A node is composed by two categories of fields: The field with the information necessary for processing; The field with the information for connecting with the successor node in the simply linked […]
How to: Implement Sparse Matrix Data Structure in C++ Using Array
The sparse matrix represents a special type of two-dimensional array consisting of a large number of elements from out of which a very high proportion is occupied by null elements. Thus, the classical declaration of a two-dimensional array in the C++ programming language leads to unnecessary use of memory by storing null values and of […]