The vector is a linear data structure that bridges the gap b

The vector is a linear data structure that bridges the gap between the static array and the dynamic linked list data structures. Create a templated, robust vector data structure making use of the ideas of encapsulation and information hiding. Code the standard feature set for a vector including but not limited to: insertion, deletion, sorting, size, etc. Also, implement the necessary hidden properties and methods to facilitate the algorithms of the vector.

C++

Solution

/*
* C++ Program to Implement Vector
*/
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
using namespace std;
int main()
{
vector<int> ss;
vector<int>::iterator it;
int choice, item;
while (1)
{
cout<<\"\ ---------------------\"<<endl;
cout<<\"Vector Implementation in Stl\"<<endl;
cout<<\"\ ---------------------\"<<endl;
cout<<\"1.Insert Element into the Vector\"<<endl;
cout<<\"2.Delete Last Element of the Vector\"<<endl;
   cout<<\"3.Size of the Vector\"<<endl;
cout<<\"4.Display by Index\"<<endl;
cout<<\"5.Dislplay by Iterator\"<<endl;
cout<<\"6.Clear the Vector\"<<endl;
cout<<\"7.Exit\"<<endl;
cout<<\"Enter your Choice: \";
cin>>choice;
switch(choice)
{
case 1:
cout<<\"Enter value to be inserted: \";
cin>>item;
ss.push_back(item);
break;
case 2:
cout<<\"Deleted Last Element Inserted\"<<endl;
ss.pop_back();
break;
case 3:
   cout<<\"Size of Vector: \";
   cout<<ss.size()<<endl;
break;
case 4:
cout<<\"Displaying Vector by Index: \";
   for (int i = 0; i < ss.size(); i++)
   {
cout<<ss[i]<<\" \";
   }
   cout<<endl;
break;
case 5:
   cout<<\"Displaying Vector by Iterator: \";
   for (it = ss.begin(); it != ss.end(); it++)
   {
cout<<*it<<\" \";
   }
   cout<<endl;
break;
case 6:
ss.clear();
cout<<\"Vector Cleared\"<<endl;
break;
   case 7:
exit(1);
break;
default:
cout<<\"Wrong Choice\"<<endl;
}
}
return 0;
}

out put