#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; } void frequency::findfreq(){     freq = 0;     for (int i=0; i<n; i++)     if(m[i] == ele)     freq++; } void frequency::display(){     if(freq > 0)     count<<“Frequency of “<<ele<<” is “<<freq;     else     cout<<ele<<” does not exist”; } void main(){     frequency F;     clrscr();     F.getdata();     F.findfreq();     F.display();     getch(); }   OUTPUT: ——————- Enter the size of the array: 5 Enter 5 elements into the array: 10 50 40 30 40 Enter the search element: 40 Frequency of 40 is 2 ——————– ——————- Enter the size of the array: 5 Enter 5 elements into the array: 10 50 40 30 40 Enter the search element: 35 25 does not exist ——————–

#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;     } }; int item::count; //——-Main Program— int main(){     item a,b,c;     clrscr();     cout<<“———-\n”;     cout<<“Before reading data\n”;     a.getcount();     b.getcount();     c.getcount();     cout<<“———————————-\n”;     cout<<“Enter value to object a\n”;     a.getdata();     cout<<“Enter value to object b\n”;     b.getdata();     cout<<“Enter value to object b\n”; […]

Bubble sort is a simple sorting algorithm. The algorithm starts at the beginning of the data set. It compares the first two elements, and if the first is greater than the second, it swaps them. It continues doing this for each pair of adjacent elements to the end of the data set. It then starts […]

#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);     } }; //—————————————– void main() {     SI s1;     int p,t;     float r;     clrscr();     cout<<“—————————————-\n”;     cout<<“Enter the value for Principal amount:”;     cin>>p;     cout<<“\n Enter the value for time:”;     cin>>t;     cout<<“\n Enter the value for rate:”;     cin>>r;     cout<<“\n ———————————\n”;     s1=SI(p,t,r);     cout<<“The Simple Interest =”<<s1.show()<<endl;     cout<<“————————————–\n”;     getch(); } OUTPUT: ———————————– Enter the value for Principal amount: 4515 Enter the value for time: 5 Enter the value for rate: 10.8 ———————————— The Simple Interest = 2438.100098 ———————————— ———————————– Enter the value for Principal amount: 3000 Enter the value for time: 4 Enter the value for rate: 5.5 ———————————— The Simple Interest = 660 ————————————

Selection sort works by repeatedly finding the smallest (or largest) element from the unsorted part of the array and putting it in its correct position in the sorted part. Steps: Start with the first element (index 0) as the minimum. Compare it with every element in the unsorted part of the array to find the […]

Linear search checks each element in the array one by one until the desired element is found or the array ends. Steps: Start from the first element. Compare the current element with the key (number to be searched). If it matches, return its position (index). If not, move to the next element. If the end […]