HTL & C++ Program

In these repository you will find basic to andvance program !!!

Index :

• Binary Search
• Vector Push & Pop
• Priority Queue All Opretion
• Priority Queue Compareter
• Queue All Opration
• Sort
• Sort Reverse
• Sort Reverse Compare Values Print
• Vector Sort
• Stack Opration All
• Vector Sort Capacity
• Vector Sort Capacity Max Size
• Vector Sort Clear
• Vector Sort Reserve
• Vector Sort Clear
• Vector Sort Revers
• Custom Comparater Priority Queue

Binary Search

#include<bits/stdc++.h>
using namespace std;

binary_search(int arr[],int l,int r,int x)
{
		int mid;
		if(r>=l){
	
		int mid = l + ( r - l ) / 2;
	
		if( arr[mid] == x )
	
			return mid;
	
		if( arr[mid] > x )
	
		return binary_search(arr, l, mid-1, x);
		
		return binary_search(arr, mid+1, r, x);
	
}
	return -1;

}
int main()
{
	 int arr[] = { 2, 3, 4, 10, 40 }; 
    int x = 10; 
    int n = sizeof(arr) / sizeof(arr[0]); 
    int result = binary_search(arr, 0, n - 1, x); 
    (result == -1) ? cout << "Element is not present in array"
                   : cout << "Element is present at index " << result; 
    return 0;
}

Output

Vector Push & Pop

#include<iostream>
#include<conio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	vector<int> v;
	int n;
	cin>>n;
	
	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
	v.pop_back();
	for(int i=0;i<v.size();i++)
	{
		cout<<v[i];
	}
	
}

Output

Priority Queue All Opretion

#include<iostream>
#include<queue>
using namespace std;

int main()
{
	priority_queue<int>pq;
	int a[]={2,5,3,1,4};
	
	for(int i=0;i<5;i++)
	{
		pq.push(a[i]);	
	}
	
	while(!pq.empty()){
		cout<<pq.top();
		pq.pop();
	}
	return 0;
}

Output

Priority Queue Compareter

#include<iostream>
#include<queue>
#include<vector>
#include<functional>

using namespace std;

int main()
{
	priority_queue<int,vector<int>,greater<int> > pq;	
	int a[]={2,5,3,1,4};
	
	for(int i=0;i<5;i++)
	{
		pq.push(a[i]);	
	}
	
	while(!pq.empty()){
		cout<<pq.top();
		pq.pop();
	}
	return 0;
}

Output

Queue All Opration

#include<stdio.h>
#include<iostream>
#include<queue>

using namespace std;

	int main()
	{
		
		queue <int> s;
		
		for(int i=0;i<5;i++)
		{
			s.push(i);
		}
		
		while( ! s.empty() )
		{
			cout<<s.front()<<endl;
			s.pop();
		}
	}
					

Output

Sort

#include<iostream>
#include<algorithm>
using namespace std;


int main()
{
	int a[] ={3,5,2,1,6,7};
	int n=sizeof(a)/sizeof(int);
	
	sort(a,a+n);
	for(int i=0;i<n;i++)
	{
		cout<<a[i]<<"";
		
	}
	
	
}

Output

Sort Reverse

#include<iostream>
#include<algorithm>
using namespace std;
 
 bool myCompare(int a, int b)
{
	return a>b;
}
int main()
{
	int a[] ={3,5,2,1,6,7};
	int n=sizeof(a)/sizeof(int);
	
	sort(a,a+n,myCompare);
	for(int i=0;i<n;i++)
	{
		cout<<a[i]<<"";
		
	}
	
	
}

Output

Sort Reverse Compare Values Print

#include<iostream>
#include<algorithm>
using namespace std;
 
 bool myCompare(int a, int b)
{
	cout<<a<<"<--->"<<b<<""<<endl;
	return a>b;
}
int main()
{
	int a[] ={3,5,2,1,6,7};
	int n=sizeof(a)/sizeof(int);
	
	sort(a,a+n,myCompare);
	for(int i=0;i<n;i++)
	{
		cout<<a[i]<<"";
		
	}
	
	
}

Output

Vector Sort

#include<iostream>
#include<conio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	vector<int> v;
	int n;
	cin>>n;

	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
		sort(v.begin(),v.end());
	v.pop_back();
	for(int i=0;i<v.size();i++)
	{
		cout<<v[i];
	}
	
}

Output

Stack Opration All

#include<stdio.h>
#include<iostream>
#include<stack>
#include<cstring>
using namespace std;

	int main()
	{
		
		stack <string> s;
	//	cout<<"pop opretion preform:-";
		s.push("Tejas");
		s.push("Akash");
		s.push("Hardik");
	//	s.pop();
		while( ! s.empty() )
		{
			cout<<s.top()<<endl;
			s.pop();
		}
	}
  

Output

Vector Sort Capacity

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

	bool compare(int a,int b){
		return a>b;
		
	}

int main()
{

	vector<int> v;
	v.reserve(22);
	int n;
	cin>>n;
	

	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
		
		sort(v.begin(),v.end(),compare);
	cout<<v.max_size();
		//v.clear();
		cout<<v.capacity()<<endl;
	for(int i=0;i<v.size();i++)
	{
		cout<<v[i]<<endl;

	}
	
	
}

Output

Vector Sort Capacity Max Size

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

	bool compare(int a,int b){
		return a>b;
		
	}

int main()
{

	vector<int> v;
	v.reserve(22);
	int n;
	cin>>n;
	

	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
		
		sort(v.begin(),v.end(),compare);
	cout<<v.max_size();
		//v.clear();
		cout<<v.capacity()<<endl;
	for(int i=0;i<v.size();i++)
	{
		cout<<v[i]<<endl;

	}
	
	
}

Output

Vector Sort Clear

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

	bool compare(int a,int b){
		return a>b;
		
	}

int main()
{

	vector<int> v;
	v.reserve(22);
	int n;
	cin>>n;
	

	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
		
		sort(v.begin(),v.end(),compare);
		
		v.clear();
		cout<<v.capacity()<<endl;
	for(int i=0;i<v.size();i++)
	{
		cout<<v[i]<<endl;

	}
	
	
}

Output

Vector Sort Reserve

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

	bool compare(int a,int b){
		return a>b;
		
	}

int main()
{

	vector<int> v;
	v.reserve(22);
	int n;
	cin>>n;


	for(int i=0;i<n;i++)
	{
		int temp;
		cin>>temp;
		v.push_back(temp);
		
	}
		
		sort(v.begin(),v.end(),compare);

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

Output

Custom Comparater Priority Queue

 #include<iostream>
 #include<vector>
 #include<functional>
 #include<queue>
using namespace std;
 
class car
{
	public:
		int x;
		int y;
		int id;
		
	car(int id, int x, int y){
		this->id = id;
		this->x = x;
		this->y = y;
		 
	}	
	int dist()
	{
		return x*x+y*y;
		
	}	
	void print()
	{
		cout<<"ID:-"<<id;
		cout<<"LOCATION :"<<x<<",,,"<<y<<endl;
	}
		
};
class carcompare{
	public :
		bool operator()(car a, car b){
			return a.dist()<b.dist();
		}
};

int main()
{
	priority_queue<car,vector<car>,carcompare> pq;
	
	int x[10]={4,3,6,2,1,7,8};
	int y[10]={23,42,41,2,1,2,4};
	
	 for(int i=0;i<7;i++)
	{
	 car C(i,x[i],y[i]);
	 pq.push(C);
	}
	
	while(!pq.empty())
	{
		car p = pq.top();
		p.print();
		pq.pop();
		
	}
	
}

Output