Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Bubble sort C program:
Write a program to define a bubble sort.
void main()
{
clrscr();
int a[100],ch,n;
cout<<"enter the limit for the array : ";
cin>>n;
for (int i=0;i { cout<<"enter element "< cin>>a[i]; } clrscr(); cout<<"1. bubble sorting"< bsort(a,n); } } void bsort(int a[100],int n) { clrscr(); int i,j,ch2,t; cout<<"1. ascending order "< cout<<"2. descending order "< cout<<" your choice : "; cin>>ch2; switch(ch2) { case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
cout<<"enter element "< cin>>a[i]; } clrscr(); cout<<"1. bubble sorting"< bsort(a,n); } } void bsort(int a[100],int n) { clrscr(); int i,j,ch2,t; cout<<"1. ascending order "< cout<<"2. descending order "< cout<<" your choice : "; cin>>ch2; switch(ch2) { case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
cin>>a[i];
}
cout<<"1. bubble sorting"< bsort(a,n); } } void bsort(int a[100],int n) { clrscr(); int i,j,ch2,t; cout<<"1. ascending order "< cout<<"2. descending order "< cout<<" your choice : "; cin>>ch2; switch(ch2) { case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
bsort(a,n);
void bsort(int a[100],int n)
int i,j,ch2,t;
cout<<"1. ascending order "< cout<<"2. descending order "< cout<<" your choice : "; cin>>ch2; switch(ch2) { case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
cout<<"2. descending order "< cout<<" your choice : "; cin>>ch2; switch(ch2) { case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
cout<<" your choice : ";
cin>>ch2;
switch(ch2)
case 1 : for (i=0;i { for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
for (j=0;j { if (a[j] > a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
if (a[j] > a[j+1])
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
break;
case 2 : for (i=0;i { for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
for (j=0;j { if (a[j] < a[j+1]) { t=a[j+1]; a[j+1]=a[j]; a[j]=t; } } } break; default : cout<<" wrong choice "; } cout<<" sorted arrays by bubble "<<"\n\n"; for (i=0;i { cout< } getch(); }
if (a[j] < a[j+1])
default : cout<<" wrong choice ";
cout<<" sorted arrays by bubble "<<"\n\n";
for (i=0;i { cout< } getch(); }
cout< } getch(); }
getch();
A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t
Program for Memory Optimization of C / OpenCL Code Project Description: This is possibly a very simple project for someone with an excellent knowledge of C and OpenCL. That,
Prepare a MT4 EA to clone MT4 Trades to a Binary Options Platform Project Description: I want an EA that clones MT4 Trades to Globaltrader365, GT Options and if possible othe
E x p r e s sion and their types: An expression will be in form of mathematical expression with C++ syntax embedded with it. Expressions are of following types which m
Different implementations of OOP Object-oriented programming is not mainly concerned with the details of the program operation. Instead, it deals with the overall design of the
One person who is specialist at programming and solving problems with a computer Project Description: Dear Potential computer, hardware, programming and software genius, I
Ask question #Minimum 100 words acceptedEducational Objectives: After completing this assignment, the student should be able to accomplish the following: Apply generic algorithms i
Explain Operator Overloading It is one type of Polymorphism, an significant feature of object-oriented programming .Polymorphism means one thing having many forms, i.e. here an
what is dynamic memory?
You are given a collection of words, say as in a dictionary. You can represent it in the following compressed form: the first word will be followed by a sequence of a pair of numbe
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd