0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the pseudo code of radix sort in C?
step 1: Analyse the radix sort procedure first. step 2:Convert the procedure in to the c coding #include<stdio.h> #define MAX 5 #define SHOWPASS void print(int *a,int n) { int i; for(i=0;i printf("%d\t",a[i]); } void radixsort(int *a,int n) { int i,b[MAX],m=0,exp=1; int bucket[10]={0}; for(i=0;i { if(a[i]>m) m=a[i]; } while(m/exp>0) { for(i=0;i bucket[a[i]/exp%10]++; for(i=1;i<10;i++) bucket[i]+=bucket[i-1]; for(i=n-1;i>=0;i--) b[--bucket[a[i]/exp%10]]=a[i]; for(i=0;i a[i]=b[i]; exp*=10; #ifdef SHOWPASS printf("\nPASS : "); print(a,n); #endif } } int main() { int arr[MAX]; int i,n; printf("Enter total elements (n < %d) : ",MAX); scanf("%d",&n); printf("Enter %d Elements : ",n); for(i=0;i scanf("%d",&arr[i]); printf("\nARRAY : "); print(&arr[0],n); radixsort(&arr[0],n); printf("\nSORTED : "); print(&arr[0],n); printf("\n"); return 0; } You can see the the same program with output in related links, below.
What is ternary operation in c language?
exp ? exp : exp
How do declare function pointer having two integer parameters and returning integer pointers?
// declare a function int* function(int, int); or int* (function)(int, int); // declare a pointer to a function int* (*pointer_to_function)(int, int);
Get size of int using sizeoff?
printf ("sizeof (int) = %d\n", (int)sizeof (int));
What does c plus plus use call by value or call by reference?
When we call a function in C++ by passing the values as arguments, it is called call by value. e.g #include<iostream.h> #include<conio.h> int add(int,int); int main() { int a,b,c; cout<<"Enter numbers."; cin>>a>>b; c=add(a,b); cout<<"Sum : "<<c; return 0; } int add(int a,int b) { int c; c=a+b; return c; }
Can structure contain a pointer itself?
Yes a simple exp is the link list. struct node { int data; struct node *link; }
What is the pseudo code of radix sort in C?
step 1: Analyse the radix sort procedure first. step 2:Convert the procedure in to the c coding #include<stdio.h> #define MAX 5 #define SHOWPASS void print(int *a,int n) { int i; for(i=0;i printf("%d\t",a[i]); } void radixsort(int *a,int n) { int i,b[MAX],m=0,exp=1; int bucket[10]={0}; for(i=0;i { if(a[i]>m) m=a[i]; } while(m/exp>0) { for(i=0;i bucket[a[i]/exp%10]++; for(i=1;i<10;i++) bucket[i]+=bucket[i-1]; for(i=n-1;i>=0;i--) b[--bucket[a[i]/exp%10]]=a[i]; for(i=0;i a[i]=b[i]; exp*=10; #ifdef SHOWPASS printf("\nPASS : "); print(a,n); #endif } } int main() { int arr[MAX]; int i,n; printf("Enter total elements (n < %d) : ",MAX); scanf("%d",&n); printf("Enter %d Elements : ",n); for(i=0;i scanf("%d",&arr[i]); printf("\nARRAY : "); print(&arr[0],n); radixsort(&arr[0],n); printf("\nSORTED : "); print(&arr[0],n); printf("\n"); return 0; } You can see the the same program with output in related links, below.
What is the action replay for Pokemon pearl that is called the exp boost?
Your Pokémon gets an Exp. boost... Was that so difficult to figure out?
Polynomial multiplication program using data structures in c?
#include <stdio.h> #include <conio.h> #define MAX 10 struct term { int coeff ; int exp ; } ; struct poly { struct term t [10] ; int noofterms ; } ; void initpoly ( struct poly *) ; void polyappend ( struct poly *, int, int ) ; struct poly polyadd ( struct poly, struct poly ) ; struct poly polymul ( struct poly, struct poly ) ; void display ( struct poly ) ; void main( ) { struct poly p1, p2, p3 ; clrscr( ) ; initpoly ( &p1 ) ; initpoly ( &p2 ) ; initpoly ( &p3 ) ; polyappend ( &p1, 1, 4 ) ; polyappend ( &p1, 2, 3 ) ; polyappend ( &p1, 2, 2 ) ; polyappend ( &p1, 2, 1 ) ; polyappend ( &p2, 2, 3 ) ; polyappend ( &p2, 3, 2 ) ; polyappend ( &p2, 4, 1 ) ; p3 = polymul ( p1, p2 ) ; printf ( "\nFirst polynomial:\n" ) ; display ( p1 ) ; printf ( "\n\nSecond polynomial:\n" ) ; display ( p2 ) ; printf ( "\n\nResultant polynomial:\n" ) ; display ( p3 ) ; getch( ) ; } /* initializes elements of struct poly */ void initpoly ( struct poly *p ) { int i ; p -> noofterms = 0 ; for ( i = 0 ; i < MAX ; i++ ) { p -> t[i].coeff = 0 ; p -> t[i].exp = 0 ; } } /* adds the term of polynomial to the array t */ void polyappend ( struct poly *p, int c, int e ) { p -> t[p -> noofterms].coeff = c ; p -> t[p -> noofterms].exp = e ; ( p -> noofterms ) ++ ; } /* displays the polynomial equation */ void display ( struct poly p ) { int flag = 0, i ; for ( i = 0 ; i < p.noofterms ; i++ ) { if ( p.t[i].exp != 0 ) printf ( "%d x^%d + ", p.t[i].coeff, p.t[i].exp ) ; else { printf ( "%d", p.t[i].coeff ) ; flag = 1 ; } } if ( !flag ) printf ( "\b\b " ) ; } /* adds two polynomials p1 and p2 */ struct poly polyadd ( struct poly p1, struct poly p2 ) { int i, j, c ; struct poly p3 ; initpoly ( &p3 ) ; if ( p1.noofterms > p2.noofterms ) c = p1.noofterms ; else c = p2.noofterms ; for ( i = 0, j = 0 ; i <= c ; p3.noofterms++ ) { if ( p1.t[i].coeff p2.t[j].exp ) { p3.t[p3.noofterms].coeff = p1.t[i].coeff + p2.t[j].coeff ; p3.t[p3.noofterms].exp = p1.t[i].exp ; i++ ; j++ ; } else { p3.t[p3.noofterms].coeff = p1.t[i].coeff ; p3.t[p3.noofterms].exp = p1.t[i].exp ; i++ ; } } else { p3.t[p3.noofterms].coeff = p2.t[j].coeff ; p3.t[p3.noofterms].exp = p2.t[j].exp ; j++ ; } } return p3 ; } /* multiplies two polynomials p1 and p2 */ struct poly polymul ( struct poly p1, struct poly p2 ) { int coeff, exp ; struct poly temp, p3 ; initpoly ( &temp ) ; initpoly ( &p3 ) ; if ( p1.noofterms != 0 && p2.noofterms != 0 ) { int i ; for ( i = 0 ; i < p1.noofterms ; i++ ) { int j ; struct poly p ; initpoly ( &p ) ; for ( j = 0 ; j < p2.noofterms ; j++ ) { coeff = p1.t[i].coeff * p2.t[j].coeff ; exp = p1.t[i].exp + p2.t[j].exp ; polyappend ( &p, coeff, exp ) ; } if ( i != 0 ) { p3 = polyadd ( temp, p ) ; temp = p3 ; } else temp = p ; } } return p3 ; }
How do you differentiate exp exp exp x?
By using the chain rule. Since the derivative of exp(x) is exp(x), the derivative of exp(exp(exp(x))) is exp(exp(exp(x))) times the derivative of what is inside the parentheses, i.e., exp(exp(exp(x))) times derivate of exp(exp(x)). Continue using the chain rule once more, for this expression.
How do you calculate Basic earning Power?
What is the basic earning power ? Net Inc= 600000 ROA=8% Int EXP= 225,000 Tax Rate =35 % BEP for this is 15.31%
How do you get exp in halo when you have negative exp?
you go up exp by winning and lose exp by quitting
What are good quest in dragonfable for exp?
go to oaklore, go in the castle, go left, talk to the guy on the catapult, do the quest called explore ruins, then you get a lot of exp
30 examples of variables?
int n1; int n2; int n3; int n4; int n5; int n6; int n7; int n8; int n9; int n10; int n11; int n12; int n13; int n14; int n15; int n16; int n17; int n18; int n19; int n20; int n21; int n22; int n23; int n24; int n25; int n26; int n27; int n28; int n29; int n30;
What is ternary operation in c language?
exp ? exp : exp
What is a body of land jutting int a lake or ocean called?
a peninsula
Where the static variables are stored?
initialize static variables are stored in data segment where uninitialized static variables are stored in BSS(block storing for Symbol) it also a part of data segment exp static int i=10;//stored in data segment static int i;//stored in BSS (uninitialized data segment) Thanks NAvin
