OOP 6

  

Object Oriented Programming

Group B -

Practical : 6

Problem Statement : Write C++ program using STL for sorting and searching user defined records such as personal records (Name, DOB, Telephone number etc) using vector container.

Check Out Code Here 👇

	#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;
	cout << "-----------------------";
	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);
	return 0;
	}

view raw STL Sort Search User hosted with ❤ by GitHub

Code can get updated so also come back later to see if there is any changes. Also if there is any problem with code you can comment below. If you like it, do share with your friends.😊