Skip to main content

C++ Vector : Basics Of Vector in C++ STL

In C++, Vector is unlike array, it stores different data types such as int, double, string, float, etc. It works like the dynamic array with the ability to resize automatically itself. Vector stores data in the contiguous memory location. Two functions are needed to traverse from starting to end that is begin() and end() functions.
                             

Syntax of the vector declaration:-

            vector<data_type> variable_name (number_of_elements); 

Here number_of_elements is optional, we can also declare a vector with empty vector that contains zero elements. The data_type in the angle-brackets indicates any type of data type which is valid in c++.

Vector declaration examples:-

vector<int> numbers (10);
//In this example, we declared a vector name number of 10 integers.
vector<string> names; 
//In this, a vector name declared of string.

In every program of the vector it is necessary to add the header file at the top of the program. We must provide the appropriate #include directive at the top, since vector is a Standard Library, not in build in part of a core language. We must specify the vector header file such as
 
      #include<vector>
After a vector has been declared specifying a certain number of elements, we can refer to individual elements in the vector using square brackets to provide a subscript or index, as shown below:-
   
        numbers[10];
Some algorithms are used in the Standard library such as sort(), reverse(), random_shuffle(), max_element(), min_element(),etc. So, it is necessary to add a header file that is #include<algorithm>.
For iterating the for loop or any task which star from the beginning of the vector to the end, vector uses the begin() function and end() function.

A simple example to illustrate the vector:
 
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
   //Declaration of vector container
  vector<int> numbers(5);
   cout<<"Enter the 5 values:-";
   
   for(vector<int>::iterator it = numbers.begin(); it! = numbers.end(); it++)
   {
       cin>>*it;
   }
   sort(numbers.begin(),numbers.end());
   cout<<"After sorting:-"
    for(vector<int>::iterator it = numbers.begin(); it! = numbers.end(); it++)
    {
       cout<<*it<<" ";
    }
   return 0; 
}

Output:-

Enter the 5 values:-
8
2
9
1
10
After sorting:-
1 2 8 9 10

This is the sorting of the 5 numbers, this program contains an iterator which is used to iterate the for loop from beginning of the vector to its end. In this header file are used such as #include<iostream>, #include<vector>, #include<algorithm>, these are necessary to execute all the code of the programs because the core language have not build in vector in it.

Comments

Popular posts from this blog

Merge Arrays : Merge Two Arrays Of Different Size In C++

Merge Two Arrays C++ Program C++ program to merge two arrays of different size. First array size is m and second array size is n. The size of the first array is greater than the first array i.e. m>n.                               Algorithm :- Enter the size of first array m. Enter the size of 2nd array n. Enter the elements of 1st and 2nd array and number of elements of first array should be greater than the number of elements of second array. After m index of first array, insert the element of second array into the first array up to m+n-1. Sort the merge array of size m+n. Display the first array, which will display all the elements of the merge array of size m+n. Program: - #include<iostream> using namespace std; int main() { int i,n,m,a[15],b[5],j;//array a[] and b[] are declared cout<<"Enter the size 1st array:-"<<endl; cin>>m; cout<<"Enter the size of 2nd array(n<m...

Data Structure And Algorithm Important Topics Overview

  Overview Of Data Structures And Algorithms This post will give you the clear idea about learning data structures and algorithms . So, Data structure? => In computer science a data structure is a data organization , management and storage format that enables efficient access and modification. Or in the other words it is a way in which data is stored on a computer. Types of data structures:- Array  String Stack Queue Linked List  Binary Tree Binary Search Tree Heap Hash Table Graph Above topics, array is a linear data structure which stores the data in the sequence order, dynamic array, every data is stored in the next contiguous memory location.   String is a collection of characters. If it contains the alphabets and it also uses the digit as character. If a string is composed of numbers and characters then numbers are also treated as characters. Stack is also a linear data structure. It works either on Last In First Out or First In Last Out . It has only one ...