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];
Find out initial basic feasible solution for the given transportation problem using Least Cost Method (LCM).
write a program that counts the number of occurrences of the string in the n-th padovan string p(n) program 1 : package test.padovanstring; public class PadovanString {
answer
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 the c
Write a function that has two int parameters num and n, and returns TRUE when the nth bit in num is 1, otherwise FALSE. This function should use the function in the above problem.
Explain one-definition rule (ODR). According to one-definition rule, C++ constructs should be identically defined in each compilation unit they are used in. As per ODR, two
A: They present a degree of freedom in the interface design options. Member functions & friend functions are equally privileged (100% vested). The major difference is that a fri
A: A reference has to always refer to some object and, so, must always be initialized; pointers do not have such limits. A pointer may be reassigned to point to distinct objects wh
Hi is there any chance to get assignment for fresher tutor
how many types of loops are there and whay are they and what are its uses
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