Scribd
Upload
15 views

Oop 6

Uploaded by

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

Oop 6

Uploaded by

charul.1204
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

class Item

public:

char name[10];

int quantity;

int cost;

int code;

bool operator==(const Item& i1)

if(code==i1.code)

return 1;

return 0;

bool operator<(const Item& i1)

if(code<i1.code)

return 1;

return 0;

};

vector<Item> o1;

void print(Item &i1);

void display();
void insert();

void search();

void dlt();

bool compare(const Item &i1, const Item &i2)

return i1.cost < i2.cost;

int main()

int ch;

do

cout<<"\nWelcome.\nPlease enter your choice:";

cout<<"\n1.Insert";

cout<<"\n2.Display";

cout<<"\n3.Search";

cout<<"\n4.Sort";

cout<<"\n5.Delete";

cout<<"\n6.Exit";

cout<<"\nEnter your choice : ";

cin>>ch;

switch(ch)

case 1:

insert();

break;

case 2:

display();
break;

case 3:

search();

break;

case 4:

sort(o1.begin(),o1.end(),compare);

cout<<"\nSorted on Cost : ";

display();

break;

case 5:

dlt();

break;

case 6:

exit(0);

while(true);

return 0;

void insert()

{
Item i1;

cout<<"\nEnter Item Name : ";

cin>>i1.name;

cout<<"\nEnter Item Quantity : ";

cin>>i1.quantity;

cout<<"\nEnter Item Cost : ";

cin>>i1.cost;

cout<<"\nEnter Item Code : ";

cin>>i1.code;

o1.push_back(i1);

void display()

for_each(o1.begin(),o1.end(),print);

void print(Item &i1)

cout<<"\n";

cout<<"\nItem Name : "<<i1.name;

cout<<"\nItem Quantity : "<<i1.quantity;

cout<<"\nItem Cost : "<<i1.cost;

cout<<"\nItem Code : "<<i1.code;

cout<<"\n\n";

void search()

vector<Item>::iterator p;

Item i1;

cout<<"\nEnter Item Code to search : ";

cin>>i1.code;

p=find(o1.begin(),o1.end(),i1);
if(p==o1.end())

cout<<"\nItem not found";

else

cout<<"\nItem found";

void dlt()

vector<Item>::iterator p;

Item i1;

cout<<"\nEnter Item Code to delete : ";

cin>>i1.code;

p=find(o1.begin(),o1.end(),i1);

if(p==o1.end())

cout<<"\nItem not found";

else

o1.erase(p);

cout<<"\nItem deleted";

OUTPUT:

You might also like