ALGORITHM

1. Start the process
2. Invoke the class with pointer
3. Assign ptr<-&obj 4. Call the ptr->getdata()
a. Get the roll no and name of the student
5. Call the ptr->display()
a. Print the roll no and name
6. Stop the process

PROGRAM

#include
	#include

	class  base 
	{
		private: int x;
			float y;
		public : virtual void getdata( );
			virtual void display( );
	};
	class dev : public base
	{
		private:  int roll;
			 char name[20];
		public : void getdata( );
			void  display( );
	};	
	void base :: getdata( )  {  }
	void base :: display( )   {  }
			
	void dev :: getdata( )
	{
		cout<<” Enter Roll of  the Student “;
		cin>> roll;
		cout<<” Enter name of  the student”;
		cin>>name;
        }
	void dev :: display( )
	{
		cout<<”Name is :”< getdata( );
		ptr -> display( );
		getch( );
	}

OUTPUT

Enter the roll no of the student: 111
Enter the name of the student : Kapil Dev

Name is : Kapil Dev
Roll no is : 111

The post C++ program to implement Pure Virtual Functions first appeared on Student Projects.

Logic :  The entered integers are stored in the array A. Here, to sort the data in ascending order, any number is compared with the next numbers for orderliness. i.e. first element A[0] is compared with the second  element A[1]. If forth is greater than the prior element then swapping them, else no change. Then second element is compared with third element, and procedure is continued. Hence, after the first iteration of the outer for loop, largest element is placed at the end of the array. In the second iteration, the comparisons are made till the last but one position and now second largest element is placed at the last but one position. The procedure is traced till the array length.

If we complement the if condition in this program, it will give out the sorted array in descending order. Sorting can also be done in other methods, like selection sorting and insertion sorting, which follows in the next pages.

Here is the C program to sort the numbers using Bubble sort

#include
void main()
{
	int A[20], N, Temp, i, j;
	clrscr();
	printf(“\n\n\t ENTER THE NUMBER OF TERMS…: “);
	scanf(“%d”,&N);
	printf(“\n\t ENTER THE ELEMENTS OF THE ARRAY…:”);
	for(i=0; i<N; i++)
	{
		scanf(“\n\t\t%d”, &A[i]);
	}
	for(i=0; i<N-1; i++)
		for(j=0; j<N-i;j++)
			if(A[j]>A[j+1])
			{
				Temp = A[j];
				A[j] = A[j+1];
				A[j+1] = Temp;
			}
	printf(“\n\tTHE ASCENDING ORDER LIST IS…:\n”);
	for(i=0; i<N; i++)
		printf(“\n\t\t\t%d”,A[i]);
	getch();
}

Download exe and source code here.

The post Bubble sort program in C first appeared on Student Projects.