#include<iostram.h> #include<iomanip.h> #include<conio.> class frequency{     private:          int n, m[100], ele, freq;     public:          void getdata();         void findfreq();         void display();      }; void frequency::getdata(){     cout<<"Enter the size of the array: ";     cin>>n;     cout<<"Enter "<<n<<" elemens into the array: ";     for(int i=0; i<n; i++)     cin>>m[i];     cout<<"Enter the search element: ";     cin>>ele;...

#include<iostream.h> #include<conio.h>  class item{     ststic int count;     int number;     public:     void getdata(){         cin>>number;         count++;     }     void getcount(void)     {         cout<<"count:"<<count<<endl;     }...

Bubble sort is a simple sorting algorithm. The algorithm starts at the beginning of the data set. It compares the...

#include<iostream.h> #include<conio.h> class SI{         int P, T;         float R, Interest;     Public:         SI(){         }     SI(int P1, int T1, float R1)     {         P=P1;         T=T1;         R=R1;         Interest=(P*T*R)/100;     }     float     {         return(Interest);     } };...

Selection sort works by repeatedly finding the smallest (or largest) element from the unsorted part of the array and putting...