Scribd
Upload
6 views10 pages

C++ Data Structures Overview

Uploaded by

sanjeevani rawat
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views10 pages

C++ Data Structures Overview

Uploaded by

sanjeevani rawat
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Arrays:

#include <iostream>
#include<array>

using namespace std;


int main() {

int basic[3] ={1,2,3};

array<int,4> a = {1,2,3,4};

int size = [Link]();

for(int i=0;i<size;i++ ){
cout<<a[i]<<endl;
}

cout<<"Element at 2nd Index-> "<<[Link](2)<<endl;

cout<<"Empty or not-> "<<[Link]()<<endl;

cout<<"First Element-> "<<[Link]()<<endl;


cout<<"last Element-> "<<[Link]()<<endl;

Vector:

#include <iostream>
#include<vector>
using namespace std;
int main() {

vector<int> v;

vector<int> a(5,1);

vector<int> last(a);

cout<<"print last"<<endl;
for(int i:last) {
cout<<i<<" ";
}cout<<endl;
cout<<"Capacity-> "<<[Link]()<<endl;

v.push_back(1);
cout<<"Capacity-> "<<[Link]()<<endl;

v.push_back(2);
cout<<"Capacity-> "<<[Link]()<<endl;

v.push_back(3);
cout<<"Capacity-> "<<[Link]()<<endl;
cout<<"Size-> "<<[Link]()<<endl;

cout<<"Elemetn at 2nd Index" <<[Link](2)<<endl;

cout<<"front " <<[Link]()<<endl;


cout<<"back " <<[Link]()<<endl;

cout<<"before pop"<<endl;
for(int i:v) {
cout<<i<<" ";
}cout<<endl;

v.pop_back();

cout<<"after pop"<<endl;
for(int i:v) {
cout<<i<<" ";
}

cout<<"before clear size "<<[Link]()<<endl;


[Link]();
cout<<"after clear size "<<[Link]()<<endl;

Deque:
#include <iostream>
#include<deque>
using namespace std;
int main() {

deque<int> d;

d.push_back(1);
d.push_front(2);

//d.pop_front();
cout<<endl;

cout<<"Print First INdex Element-> "<<[Link](1)<<endl;

cout<<"front "<<[Link]()<<endl;
cout<<"back "<<[Link]()<<endl;

cout<<"Empty or not" <<[Link]()<<endl;

cout<<"before erase" <<[Link]()<<endl;


[Link]([Link](),[Link]()+1);
cout<<"after erase" <<[Link]()<<endl;
for(int i:d){
cout<<i<<endl;
}

List:
#include <iostream>
#include<list>

using namespace std;


int main() {
list<int> l;

list<int> n(5,100);
cout<<"Printing n"<<endl;
for(int i:n) {
cout<<i<<" ";
}cout<<endl;
l.push_back(1);
l.push_front(2);
for(int i:l) {
cout<<i<<" ";
}
cout<<endl;
[Link]([Link]());
cout<<"after erase"<<endl;
for(int i:l) {
cout<<i<<" ";
}

cout<<"size of list"<<[Link]()<<endl;
}

Stack:

#include <iostream>
#include<stack>

using namespace std;


int main() {
stack<string> s;

[Link]("love");
[Link]("babbar");
[Link]("Kumar");

cout<<"Top Element-> "<<[Link]()<<endl;

[Link]();
cout<<"Top Element-> "<<[Link]()<<endl;

cout<<"size of stack"<<[Link]()<<endl;

cout<<"Empty or not "<<[Link]()<<endl;

}
Queue:

#include <iostream>
#include<queue>

using namespace std;


int main() {

queue<string> q;

[Link]("love");
[Link]("Babbar");
[Link]("Kumar");

cout<<"Size before pop" <<[Link]()<<endl;

cout<<"First Element "<<[Link]()<<endl;


[Link]();
cout<<"First Element "<<[Link]()<<endl;

cout<<"Size after pop" <<[Link]()<<endl;

Priority Queue:

#include <iostream>
#include<queue>

using namespace std;


int main() {
//max heap
priority_queue<int> maxi;

//min - heap
priority_queue<int,vector<int> , greater<int> > mini;

[Link](1);
[Link](3);
[Link](2);
[Link](0);
cout<<"size-> "<<[Link]()<<endl;
int n = [Link]();
for(int i=0;i<n;i++) {
cout<<[Link]()<<" ";
[Link]();
}cout<<endl;

[Link](5);
[Link](1);
[Link](0);
[Link](4);
[Link](3);

int m = [Link]();
for(int i=0;i<m;i++) {
cout<<[Link]()<<" ";
[Link]();
}cout<<endl;

cout<<"khaali h kya bhai ?? -> "<<[Link]()<<endl;

Set:

#include <iostream>
#include<set>

using namespace std;


int main() {
set<int> s;

[Link](5);
[Link](5);
[Link](5);
[Link](1);
[Link](6);
[Link](6);
[Link](0);
[Link](0);
[Link](0);

for(auto i : s) {
cout<<i<<endl;
}cout<<endl;

set<int>::iterator it = [Link]();
it++;

[Link](it);

for(auto i : s) {
cout<<i<<endl;
}
cout<<endl;
cout<<"-5 is present or not -> "<<[Link](-5)<<endl;

set<int>::iterator itr = [Link](5);

for(auto it=itr;it!=[Link]();it++) {
cout<<*it<<" ";
}cout<<endl;

}
Map:

#include <iostream>
#include<map>

using namespace std;


int main() {
map<int,string> m;

m[1]= "babbar";
m[13]="kumar";
m[2]="love";

[Link]( {5,"bheem"});

cout<<"before erase"<<endl;
for(auto i:m) {
cout<<[Link]<<" "<<[Link]<<endl;
}

cout<<"finding -13 -> " <<[Link](-13)<<endl;

// [Link](13);
cout<<"after erase"<<endl;
for(auto i:m) {
cout<<[Link]<<" "<<[Link]<<endl;
}cout<<endl<<endl;

auto it = [Link](5);

for(auto i=it;i!=[Link]();i++) {
cout<<(*i).first<<endl;
}

}
Algo:

#include <iostream>
#include<algorithm>
#include<vector>

using namespace std;


int main() {

vector<int> v;

v.push_back(1);
v.push_back(3);
v.push_back(6);
v.push_back(7);

cout<<"Finding 6-> "<<binary_search([Link](),[Link](),6)<<endl;

cout<<"lower bound-> "<<lower_bound([Link](),[Link](),6)-[Link]()<<endl;


cout<<"Uppper bound-> "<<upper_bound([Link](),[Link](),4)-[Link]()<<endl;

int a =3;
int b =5;

cout<<"max -> "<<max(a,b);

cout<<"min -> "<<min(a,b);

swap(a,b);
cout<<endl<<"a-> "<<a<<endl;

string abcd = "abcd";


reverse([Link](),[Link]());
cout<<"string-> "<<abcd<<endl;

rotate([Link](),[Link]()+1,[Link]());
cout<<"after rotate"<<endl;
for(int i:v){
cout<<i<<" ";
}

sort([Link](),[Link]());
cout<<"after sorting"<<endl;
for(int i:v){
cout<<i<<" ";
}

You might also like