LIST ADT USING ARRAY

 #include<iostream>

using namespace std;

void create();

void insert();

void deletion();

void search();

void display();

int a,b[20],n,d,e,f,i;

int main()

{

int c;

cout<<"\n Main Menu";

cout<<"\n 1.Create \n 2.Delete \n 3.Search \n 4.insert \n 5.Display \n 6.Exit";

do

{

cout<<"\n enter your choice:";

cin>>c;

switch(c)

{

case 1: create(); break;

case 2: deletion(); break;

case 3: search(); break;

case 4: insert(); break;

case 5: display(); break;

case 6: exit(0); break;

default:

cout<<"The given number is not between 1-5\n";

}

}

while(c<=6);

return 0;

}

void create()

{

cout<<"\n Enter the number of elements you want to create: ";

cin>>n;

cout<<"\nenter the elements\n";

for(i=0;i<n;i++)

{

cin>>b[i];

}

}

void deletion()

{

cout<<"Enter the number u want to delete \n";

cin>>d;

for(i=0;i<n;i++)

{

if(b[i]==d)

{

b[i]=0;

cout<<d<<" deleted";

}

}

}

void search()

{

cout<<"Enter the number \n";

cin>>e;

for(i=0;i<n;i++)

{

if(b[i]==e)

{

cout<<"Value found the position\n"<<i+1;

} 

}

}

void insert()

{

cout<<"\nenter how many number u want to insert: ";

cin>>f;

cout<<"\nEnter the elements\n";

for(i=0;i<f;i++)

{

cin>>b[n++];

}

}

void display()

{

for(i=0;i<n;i++)

{

cout<<"\n"<<b[i];

}

}

Comments

  1. HAIAGREEVA TUITION CENTREJune 14, 2024 at 7:37 AM

    // Online C++ compiler to run C++ program online
    #include
    using namespace std;
    void create();
    void insert();
    void deletion();
    void search();
    void display();
    int a,b[100],n,d,e,f,i;
    int main()
    {
    int c;
    cout<<"/n MAIN MENU";
    cout<<"\n 1- CREATE \n2-DELETE \n3-SEARCH \n 4-INSERT \n 5-UPDATE";
    do
    {
    cout<<"\n Enter your choice";
    cin>>c;
    switch(c)
    {
    case 1:create();break;
    case 2:deletion();break;
    case 3:search();break;
    case 4:insert();break;
    case 5:display();break;
    default:
    cout<<"given number is invalid";
    }
    }
    while(c<=6);
    return 0;
    }
    void create()
    {
    cout<<"\nEnter the elements u need to create";
    cin>>n;
    cout<<"\n Enter the elements";
    for(i=0;i>b[i];
    }
    }
    void deletion()
    {
    cout<<"\n Enter the lemetns to delete";
    cin>>d;
    for(i=0;i>e;
    for(i=0;i>f;
    cout<<"\nenter the lemtns";
    for(i=0;i>b[n++];
    }
    }
    void display()
    {
    for(i=0;i<n;i++)
    {
    cout<<"\n"<<b[i];
    }
    }

    ReplyDelete

Post a Comment

Popular posts from this blog

LIST ADT USING LINKED LIST

 #include <iostream> using namespace std; struct Node {     int data;     Node* next; }; Node* head = nullptr; void insert() {     int value;     cout << "\nEnter the element to insert: ";     cin >> value;     Node* newNode = new Node{value, nullptr};     if (!head) {         head = newNode;     } else {         newNode->next = head;         head = newNode;     } } void display() {     if (!head) {         cout << "\nList is empty\n";         return;     }     Node* temp = head;     cout << "\nList elements:\n";     while (temp) {         cout << temp->data << " ";         temp = temp->next;     }     cout << "\n"; } int main() { ...
Read more

CLASSES CREATION

  #include <iostream> using namespace std; class sample   //class creation { public: static int a; // datatype static void data() { cout<<"i am the best"; } //function }; int sample::a=10; //declaring datatype int main() { cout<<sample::a<<"\n";    //printing data sample::data();    //printing function without return type return 0; }
Read more

SORTING PROGRAM

 #include <iostream> using namespace std; int main() {     int n[5], i, num_elements;     cout << "Enter the number of elements (up to 3): ";     cin >> num_elements;     if (num_elements > 3) {         cout << "Number of elements exceeds the limit of 3." << end;         return 1;     }     cout << "Enter " << num_elements << " elements:" << endl;     for (i = 0; i < num_elements; i++) {         cin >> n[i];     }     int temp, j;     for (i = 1; i < num_elements; i++) {         j = i;         while (j > 0 && n[j] < n[j - 1]) {             temp = n[j];             n[j] = n[j - 1];             n[j - 1] = temp;  ...
Read more