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!
Radix sort - C program:
Write a program in c to define a radix sort.
void main()
{
int array[100],n;
int i;
void radix(int *,int);
printf ("How many nos\n");
scanf("%d",&n);
for(i= 0;i< n;i++)
printf("array[%d]=?",i+1);
scanf("%d",&array[i]);
}
radix(array,n);
printf("%d ",array[i]);
getch();
void radix(int *array,int n)
int a[2][100],ptr[2];
int i,b=1,j,k;
for(i=0;i<16;i++)
ptr[0]=ptr[1]=0;
for(j=0;j { if((array[j]&(b< a[1][ptr[1]++]=array[j]; else /* bit wise operations*/ a[0][ptr[0]++]=array[j]; } for(j=0;j array[j]=a[0][j]; for(k=0;k array[j+k]=a[1][k]; } }
if((array[j]&(b<
a[1][ptr[1]++]=array[j];
else /* bit wise operations*/
a[0][ptr[0]++]=array[j];
for(j=0;j array[j]=a[0][j]; for(k=0;k array[j+k]=a[1][k]; } }
array[j]=a[0][j];
for(k=0;k array[j+k]=a[1][k]; } }
array[j+k]=a[1][k];
The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst. Shortest remaining time rst algori
Describe problem with Runtime type identification? A: The run time kind identification comes at cost of performance penalty. Compiler maintains class.
Develop a Student class that has the following header file: #ifndef STUDENT_H #define STUDENT_H #include #include #include using namespace std; class Stu
A parking garage charges a $2.00 minimum fee to park for up to three hours and an additional $0.50 per hour for each hour or part thereof over three hours. The maximum charge for a
write a simple c++ program to that use the value to add five number .your program should prompt the user to enter these five numbers one after the other
A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome
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????
A: No. If they're utilized properly, they increase encapsulation. You frequently require splitting a class in half while the two halves will have distinct numbers of instances o
What is the difference between early binding and late binding? What are advantages of early binding? a.) Late binding refers to function calls which aren't resolved until run t
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