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!
Shell sort - C Program:
Write a program to define shell sort.
void main()
{ //program for sorting by select sort
int a[20],i,k,j,n;
clrscr();
printf("How many nos are to be sorted\n");
scanf("%d",&n);
for (i=0;i<=n-1;i++)
{
printf("Enter the value of %d no\t",i+1);
scanf("%d",&a[i]);
}
printf("Make sure !Are your values read correctly?\n");
printf("%d \n",a[i]);
for (i=0;i<=n-1;i++) //In select sort we consider the 1 st element &
for (j=i+1;j<=n-1;j++) //compare it with the remaining in the 1st step
{ //&swaping is done next considering 2nd element etc.
if (a[i] >= a[j])
k=a[i];
a[i]=a[j];
a[j]=k;
printf("The sorted data is\n");
for (j=0;j<=n -1;j++)
printf("%d\n",a[j]);
getch();
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
dispaly the last ant on rod
A name clash happens when a name is described in more than one place. For example, two dissimilar class libraries could give two different classes the similar name. If you try to u
Is Overloading of Destructor possible?
program coding for the conversion of string to a palindrome
A: Use operator overloading to present a friend left-shift operator, operator #include class Fred { public: friend std::ostream& operator ... private: int i_; // onl
Pointers to Objects Passing and returning of objects is, though, not very efficient since it includes passing and returning a copy of the data members. This problem can be elim
Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec
The program sorting.cpp contains a main function for testing the operation of several sort algorithms over various data sizes and data set organisations. The program understands
A: Use p = new T[n] and delete[] p: Fred* p = new Fred[100]; ... delete[] p; Any time you allocate an array of objects through new (generally with the [n] in the n
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