No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
how do i write the following functions:can somebody help me with this programm? [code] int lengthOfString(char *string); [/code] the longer the text that is given,the longer the text caculation [code] int letsFactorise(int charCount); [/code] the length of the texts in order of prime number,if no prime numbers then give Error-code … |
|
How do i write a programm that the given text.the longer the text will factorized (in primenumber order).The text is for the following transformation as matrix with the Dimention [B]n[/B](breath;smaller Primefactor) multiply [B]m[/B](highest;bigger Primefactor).The letters of this matrix will in column by column displayed the output format is the transpose … |
|
can someone give me a hint on how to write C programm with this output. 0 00000000 00000000 00000000 00000000 cammand 1 00000000 00000000 00000000 00000001 and so on i ve try this but it doent work scanf("%d",integer) printf("\n wert war: %d,integer") return 0; |
|
i try to compile this programm useing pluto,it shows me error .where schould the fehler be? [code=c] #include <"stdio.h"> int main() { int counter; int even=0; int b= 7,int h= 10; if h+ = b % 10; b /= 10; for( counter = 1; counter <= 10; counter++); { if … |
|
how do i write a C programm to add two figures together e.g b and h if b = 0125 and h =2354 b = 0+1+2+5 = 8 h = 2+3+5+4 = 14 and the output to be ++++++++ * * * * * * * * ++++++++ * * … |
|
|
|
1 proof that: n! = O(n^n). 2.proof that: ln n = O(square of n). 3.proof that: ln(n!) ="theta"(n ln n). 4.proof that from: f(n) = O(g(n)) next 2^f(n) = O^(2g(n)). |
|
can spmeone help me with any c compiler avaliable that i can easy download and the keys that i can use for the command. |