STL ALGORITHMS

Presented by: ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

What is STL? ,[object Object],[object Object],[object Object],[object Object]

Uses of STL – Why should it be used? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

The three parts of STL ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Introduction to STL Algorithms ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

The sort() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[10]={2,4,1,5,6,7,-11,23,9,-1999}; for (int a=0;a<10;a++) { cout <<arr[a]<<""; } cout <<endl; sort (arr,arr+10); for (a=0;a<10;a++) { cout<<arr[a]<<"";; } }

Extended Example #include<algorithm> #include<iostream.h> #include<list.h> using namespace std; void main() { list <int> dc,dc2; dc.push_back(9); dc.push_back(10); dc.push_back(-11); dc2=dc; while(! dc.empty() ) { cout<<dc.front(); dc.pop_front(); cout<<endl; } dc2.sort(); cout<<endl; while(! dc2.empty() ) { cout<<dc2.front(); dc2.pop_front(); cout<<endl; } }

The rotate() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> int arr[10]={1,2,3,4,5,6,7,8,9,10}; rotate (arr,arr+4,arr+10); for ( int a=0;a<10;a++) { cout <<arr[a]<<""; } cout <<endl; [ Output will be “ 5 6 7 8 9 10 1 2 3 4 5”]

The rotate_copy() function ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

The reverse() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> char arr[5]={'a','b','c','d','e'}; reverse (arr,arr+5); for (int a=0;a<5;a++) { cout <<arr[a]<<""; } cout <<endl; [Output will be “e d c b a”]

Extended Example #include<algorithm> #include<iostream.h> #include<list.h> #include<vector.h> using namespace std; void main() { vector <int> v; vector <int> ::iterator it; v.push_back(10); v.push_back(11); v.push_back(12); v.push_back(13); v.push_back(14); v.push_back(15); for(it=v.begin();it!=v.end();it++) { cout<<*it<<" "; } cout<<endl; reverse(v.begin(),v.end()); cout<<endl; for(it=v.begin();it!=v.end();it++) { cout<<*it<<" "; } }

The random shuffle() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> char arr[5]={'a','b','c','d','e'}; random_shuffle (arr,arr+5); for (int a=0;a<5;a++) { cout <<arr[a]<<""; } cout <<endl; [Output can be “e b d c a”]

Extended Example #include<algorithm> #include<iostream.h> #include<vector.h> using namespace std; void main() { vector <int> v; vector <int> ::iterator it; v.push_back(1); v.push_back(2); v.push_back(3); v.push_back(4); v.push_back(5); v.push_back(6); v.push_back(7); v.push_back(8); v.push_back(9); v.push_back(10); for(it=v.begin();it!=v.end();it++) { cout<<*it<<" "; } cout<<endl; random_shuffle(v.begin(),v.end()); cout<<endl; for(it=v.begin();it!=v.end();it++) { cout<<*it<<" "; }

The find function ,[object Object],[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { c har arr[20]="abcdefgh"; char *p; p= find (arr,arr+7,'d'); puts (p); }

The replace function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { char arr[20]="faizansuhail"; replace (arr,&arr[10],'a','b'); puts (arr); }

The fill function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int ar[20]={23,45,56,4,45,23}; fill (ar,ar+5,45); for (int a=0;a<5;a++) cout <<""<<ar[a]; }

The remove function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { char arr[20]="abcdefgh"; char *p; p= remove (arr,&arr[7],'h'); puts (p); }

The search function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { char source[20]="abcdefgh"; char tar[20]="fgh",*p; p= search (source,&source[7],tar,&tar[2]); if (*p==source[7]) { cout <<"not found"; } else { puts (p); cout <<"found"; } }

The swap function ,[object Object],[object Object],[object Object]

An example : #include <iostream> #include <algorithm> #include <vector> void main() { vector <int> obj; vector <int> tar; obj.push_back(1); obj.push_back(2); obj.push_back(3); tar.push_back(4); tar.push_back(5); tar.push_back(6); swap(obj,tar); cout<<obj[0]; cout<<obj[1]; cout<<obj[2]; cout<<tar[0]; cout<<tar[1]; cout<<tar[2];} }

The swap ranges function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> #include <vector> void main() { void main() { int arr[]={1,2,3,4,5,6}; int tar[]={6,7,8,9,10,11,12}; swap_ranges(arr,arr+6,tar); for (int a=0;a<5;a++) { cout<<""<<arr[a]; } } }

The count function ,[object Object],[object Object]

An example : #include <iostream> #include <algorithm> #include <vector> void main() { int a; int arr[]={1,2,3,4,5,6,7}; a=mycount(&arr[0],&arr[7],7); cout<<"7 come"; cout<<""; cout<<a; cout<<"times"; cout<<"************************"; } int mycount(int *p,int *q,int b) { int a=0; while (p!=q) { if (*p++==7) { a++; } } return a; }

The minimum function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> #include <vector> void main() { int *a; char *p; int arr[]={1,2,3,4,5,6,7}; char tar[]={'a','b','c','d'}; a= min_element (arr,arr+7); p= min_element (tar,tar+4); cout<<""; cout<<*a; cout<<""; cout<<*p; cout<<""; }

The maximum function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> #include <vector> void main() { int *a; char *p; int arr[]={1,2,3,4,5,6,7}; char tar[]={'a','b','c','d'}; a= max_element (arr,arr+7); p= max_element (tar,tar+4); cout<<""; cout<<*a; cout<<""; cout<<*p; cout<<"";}

The equal function ,[object Object],[object Object]

An example : #include <iostream> #include <algorithm> #include <vector> void main() { int arr[]={1,2,3,4,5}; int brr[]={1,2,3,4,5}; int crr[]={1,2,3,4,1}; if (equal(arr,arr+5,brr)) { cout<<"ok"; } else { cout<<"not ok"; } if (equal(arr,arr+5,crr)) { cout<<"ok"; } else { cout<<"not ok"; }

The for_each() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { myfunction (int i) { i=i+2 } void main() { int arr[]={1,2,3,4,5}; for_each(arr,arr+5,myfunction); cout<<""<<arr; }

The find_if() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { bool iseven(int i) { if(i%2==0) return true; else return false } void main() { int arr[]={1,2,3,4,5}; it =find_if(arr,arr+5,iseven); cout<<""<<*it;}

The binary search() function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[ ]={1,2,3,4,5}; int *it; bool a; a=binary_search(arr,arr+5,4); cout<<a; }

The merge function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[]={1,2,3,4,5}; int brr[]={6,7,8,9,10}; int crr[10]; merge(arr,arr+5,brr,brr+5,crr); for(int a=0;a<10;a++) { cout<<crr[a]; } }

The copy function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[ ]={1,2,3,4,5}; int crr[10]; copy (arr,arr+5,crr); for(int a=0;a< 5 ;a++) { cout<<crr[a] <<“” ; } }

The lexographical function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { string a=“pakistan”; string b=“waziristan”; if(lexographical_compare(a, a+7, b, b+9)) cout<<“sab sey pehle Pakistan”<<endl }

The make_heap function ,[object Object],[object Object],[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[10]={1,2,3,4,5,6,7,8,9}; for(int a=0;a<10;a++) { cout<<arr[a]<<""; } cout<<endl; make_heap(arr, &arr[9]); for(a=0;a<10;a++) { cout<<arr[a]<<"";; } }

The push_heap function ,[object Object],[object Object],[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[10]={1,2,3,4,5,6,7,8,9}; make_heap(arr, &arr[9]); arr[9]=31; push_heap(arr, &arr[10]); for(a=0;a<10;a++) { cout<<arr[a]<<"";; }

The pop_heap function ,[object Object],[object Object],[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[10]={1,2,3,4,5,6,7,8,9}; make_heap (arr, &arr[9]); pop_heap(arr, &arr[8]); for(int a=0;a<10;a++) { cout<<arr[a]<<"";; }

The sort_heap function ,[object Object],[object Object],An example : #include <iostream> #include <algorithm> void main() { int arr[10]={1,2,3,4,5,6,7,8,9}; make_heap(arr, arr[8]); arr[9]=31; push_heap(arr,&arr[9]); for(a=0;a<10;a++) { cout<<arr[a]<<"";; }

STL ALGORITHMS

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (20)

Similar to STL ALGORITHMS

Similar to STL ALGORITHMS (20)

Recently uploaded

Recently uploaded (20)

STL ALGORITHMS