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];
describe how identifiers of different data type are defined using this notaion?
Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books
The goto statement This statement can be used to branch to another statement of the program. This is rarely used as it violates the principle of structured programming. Though
padovan string p(n) programming in c
Multidimensional Arrays - Every dimension is specified in separate brackets e.g. int arr[4][3]; This is a two-dimensional array with 4 as row dimension and 3 as
Write a program to calculate the average of ten numbers #include stdio.h /* Only this header is needed since only IO are used */ void main() { char
Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send
A: it is containing and hiding Information regarding an object, like internal data structures and code. It isolates the internal complication of an object's operation from the res
B-tree: A B-tree is an also called balanced m-way tree. A node of the tree may have many records or key and pointers to children. It is also called as the balanced sort tree. It s
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
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