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];
Aim: To implement a program for dynamic data structure(linked list). Code: class node { int data; node *next;
WAP TO ACCEPT THE BASIC SALARY OF EMPLOYEES & CALCULATE NET SALARY #include stdio.h> #include conio.h> void main() { float Basi
Write out pseudocode for a function called "and" that takes two arguments, both booleans, and returns the logical and of the inputs. DO NOT use the logical and operator: instead, w
write a simple c++ program to implement a stack: 1. push 2. pop
how can i easily make a program?
Binary search in array: - C program: Write a program in c to define binary search in array. void main() { clrscr();
Readers Writers with Processes and Threads Write two programs implementing ``reader pritority readers-writers synchronization'''' on files. One program will use processes, created
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\
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
A more advanced data type is the structure; here we can define a template as a collection of different variables e.g. struct birthdate { int month; int day;
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