My discussion will cover C++
Arrays
- The array class in C++ is more efficient than C-style arrays.
- Adding elements is simple; simply supply the index to the array and an element will be added at the specified place.
- Removing an element is a time-consuming job because we must manually search for it.
- at(): This function is used to get a hold of an array element at a certain point. The element at position n in the array is returned as a reference. If n is not inside the bounds of valid elements in the container, the function automatically checks and throws an out-of-range exception (i.e., if n is greater than, or equal to, its size)
- std::array::front() is a C++ function that returns a reference to the array container's first element. This method's behavior is uncertain if the array size is zero.
- back() returns the array's final element, i.e. The last element of the array container is referred to using this function. This function can be used to get the last element in an array from the end.
- size(): This method returns the number of elements in an array object, i.e. The size of an array object is always equal to the second template argument used to create the array template class (N). Unlike the language operator size, which returns the size of the array in bytes, this member function returns the number of elements in the array.
Other methods we can use with the array class in C++ include max size(), swap(), empty(), and fill().
linked List
- There is no standard for linked lists in C++.
- To implement a linked list in C++, we commonly utilize a class (or struct).
- We must implement any technique we wish to utilize on our own.
The implementation of a linked list in C++ is accomplished through the use of pointers.We must declare a structure that defines a single node because a linked list is made up of nodes. At least one variable for the data section and a pointer to the next node should be included in our structure. i.e.
struct node
{
int data;
node *next;
};
- There is also no API for checking circular linked lists or allocating sparse arrays.
