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!
C program for bubble sort:
void main()
{
int i,j,k,a[10],n;
clrscr();
printf("How many values you want to enter\n");
scanf("%d",&n);
for(i=0;i<=n-1;i++)
printf(" %d no?\n",i+1);
scanf("%d",&a[i]);
}
for (i=0;i<=n-1;i++)
for(j=0;j { if (a[j]>a[j+1]) { k=a[j+1]; a[j+1]=a[j]; a[j]=k; } } for(i=0;i<=n-1;i++) printf("%d\n",a[i]); getch(); }
if (a[j]>a[j+1])
{ k=a[j+1];
a[j+1]=a[j];
a[j]=k;
for(i=0;i<=n-1;i++) printf("%d\n",a[i]);
getch();
how to define the structures
Describe spaghetti programming. - Spaghetti programming refers to codes which tend to get tangled and overlapped throughout the program. - It makes a program complex and ana
There are so many different concepts related with OOP (Object-oriented programming) such as: Class Object Inheritance Polymorphism Abstraction Encapsulation
# include stdio.h> # include string.h> # include conio.h> void main() { int i=0,count=0; char a[100],b; clrscr();
i need a program that find the number of negative integers in a list.
pseudocode for gregorian calendar
algorithem push and pop
Overloading Binary Operators Using Friend Function class SI {float i,p,n,r,a; public: SI(){}; SI(int gp,int gn, int gr); void putdata(void); friend SI operato
can you help with the assignment, I don''t want to upload the assignment but want somebody to work with, do you do that?
#question.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 s
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