Scribd
Upload
91 views

STL CPP Assignment

This C++ program uses STL (Standard Template Library) for sorting and searching user-defined records, specifically a "Person Record" with name, date of birth, and telephone number. The program defines a Student class with roll number, name, and date of birth data members. It implements functions for reading, printing, inserting, deleting, searching, and sorting a vector of Student objects. The main function contains a menu-driven do-while loop to call these functions and perform sorting and searching operations on the student records.

Uploaded by

Amar Yele
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
91 views

STL CPP Assignment

This C++ program uses STL (Standard Template Library) for sorting and searching user-defined records, specifically a "Person Record" with name, date of birth, and telephone number. The program defines a Student class with roll number, name, and date of birth data members. It implements functions for reading, printing, inserting, deleting, searching, and sorting a vector of Student objects. The main function contains a menu-driven do-while loop to call these functions and perform sorting and searching operations on the student records.

Uploaded by

Amar Yele
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

OBJECT ORIENTED PROGRAMMING

WRITE A PROGRAM IN C++ usING sTL fOR sORTING AND sEARChING


WITh usER-DEfINED RECORDs suCh As PERsON RECORD

Name of student :- Amar Anandrav Yele


DIV:- SE C
ROLL NO:-S223068
DEPARTMENT :- COMPUTER

STATEMENT :- Write a program in C++ using STL for Sorting and searching with user-defined
records such as Person Record

 PROGRAM CODE :-
/*
Write C++ program using STL for Sorting and searching with user-defined records
such as Person Record (Name, birth date, telephone no), */

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

using namespace std;

class student
{
public:
int rollno;
string name;
char dob[15];

bool operator==(const student &student1)


{
return(rollno==student1.rollno);
}
bool operator<(const student &student1)
{
return(rollno<student1.rollno);
}

friend ostream& operator << (ostream &out, const student &);

friend istream& operator >> (istream &in, student &k);


};

ostream & operator << (ostream &out, const student &k)


{
out<<"\n\t\t"<<k.rollno<<"\t\t"<<k.name<<"\t\t"<<k.dob;
return out;
}

istream & operator >> (istream &in , student &k)


{
cout<<"\nEnter Roll No : ";
in>>k.rollno;
cout<<"\nEnter Name : ";
in>>k.name;
cout<<"\nEnter DOB : ";
in>>k.dob;
return in;
}

bool myfunc(const student &k, const student &i2)


{
return(k.rollno<i2.rollno);
}

vector<student> read()
{
int n;
student k;
vector<student> j;
cout<< "\nEnter total no. of students : ";
cin>>n;
for(int i=0;i<n;i++)
{
cin>>k;
j.push_back(k);
}
return j;
}

void printfunction(const student &k)


{
cout<<k;
}
void print( const vector<student> &j)
{
cout<<"\n\t\tROLL NO\t\tNAME\t\tDATE OF BIRTH";
for_each(j.begin(),j.end(),printfunction);

void insert(vector<student> &j)


{
student k;
cin>>k;
j.push_back(k);
}

void delet(vector<student>&j)
{
student k;
cout<<"\nEnter Student Roll No To Delete : ";
cin>>k.rollno;
vector<student>::iterator p;
p=find(j.begin(),j.end(),k);
if(p!=j.end())
j.erase(p);
else
cout<<"\nNot found ";
}
void search( vector<student>&j )
{
student k;
cout<<"\nEnter Student Roll No To Search : ";
cin>>k.rollno;
cout<<"\n\n\t\tROLL NO\t\tNAME\t\tDATE OF BIRTH";
vector<student>::iterator p;
p=find(j.begin(),j.end(),k);
if(p!=j.end())
cout<<*p;
else
cout<<"\nNot found ";
}

void sort( vector<student> &j)


{
sort(j.begin(),j.end(),myfunc);

int main()
{
vector<student> j;
int op;
do
{

cout<<"\n\t\t1.Create ";
cout<<"\n\t\t2.Display ";
cout<<"\n\t\t3.Insert ";
cout<<"\n\t\t4.Delete ";
cout<<"\n\t\t5.Search ";
cout<<"\n\t\t6.Sort";
cout<<"\n\t\t7.Quit";
cout<<"\n\t\t--------------------------";
cout<<"\n\t\tEnter your choice : ";
cin >> op;
switch(op)
{
case 1:
j=read();
break;
case 2:
print(j);
break;
case 3:
insert(j);
break;
case 4:
delet(j);
break;
case 5:
search(j);
break;
case 6:
sort(j);
print(j);
break;
}
}while(op!=7);
}
 OUTPUT :-
 THANK YOU SO MUCH

You might also like