Search:

Type: Posts; User: Muster Mark

Search: Search took 0.00 seconds.

  1. Replies
    2
    Views
    2,725

    ah, ok. that makes sense, thanks.

    ah, ok. that makes sense, thanks.
  2. Replies
    4
    Views
    1,604

    What you are trying to do is fairly...

    What you are trying to do is fairly straight-forward, if I understand the problem properly. To change a 1 into a 0 at position n, we simply take num1^(1<<n) (note: using XOR like this will change a...
  3. Replies
    2
    Views
    2,725

    need help freeing a linked list

    Hi all,

    So, in general, freeing a linked list is pretty straight forward. my freeing function looks like this:


    typedef struct node
    {
    uint64_t digit;
    struct node *next;
    struct node...
  4. Of Course!!!

    Thank you!! I knew I was being thick! I was just stuck with the idea that the test part of the standard loop structure had to actually be the test.

    Thanks again.
  5. Is this loop construct only available using goto's???

    I know the answer must be NO!!!, but I can't think of a direct way of doing this.


    BEGIN LOOP
    loop statements;
    .
    .
    .
    TEST(test_condition)
    update statements;
  6. Hey, thanks for the response. What you say makes...

    Hey, thanks for the response. What you say makes sense. So, I guess there is no easy way to convert, for example, 2^(2^32) into base ten, at least not an obvious one. I will have to tackle it as...
  7. How does a computer do base conversion (binary decimal)?

    So, I know how to convert between bases, but I was wondering how the computer implements base conversion for I/O (I assume this is done by the OS?).

    I can think that for relatively small numbers...
  8. Replies
    2
    Views
    1,011

    You are going to need loops of some kind

    I might go for a "do while" loop myself.
    ex:
    #include <stdio.h>

    int main()
    {
    char answer;
    printf( "Play Game? (Y/N): " );
    scanf( " %c", &answer );
    if (answer == 'Y' )
  9. Replies
    6
    Views
    2,878

    Yay, it worked!

    Thanks so much! putting (unsigned long long int) in front of Primes[Test] worked wonderfully! And, best of all, I only melted one computer in verifying this:devil:(fortunately, not a valuable one).
  10. Allow me to try to help

    I am very new myself, but I think I can give you some help. I am merely learning from a book, but perhaps my knowledge is useful.

    There are very many errors in your code. The first thing I...
  11. Thread: newb help

    by Muster Mark
    Replies
    5
    Views
    1,022

    Just a minor niggle

    I'm glad your problem has been solved, but I couldn't help but point this out. You mean kilo/ounce and gram/ounce rather than what you have. The constants are correct for what you are doing with...
  12. Replies
    6
    Views
    2,878

    Why would Num be overflowing, given that it's...

    Why would Num be overflowing, given that it's maximum value is so large compared to the numbers it could be?
  13. Replies
    6
    Views
    2,878

    Thanks for the prompt reply! Overflow sounds...

    Thanks for the prompt reply!

    Overflow sounds pretty likely now that you mention it. But it still doesn't really make sense, because which variable could be overflowing? Regardless, I will now...
  14. Replies
    6
    Views
    2,878

    Some trouble with a prime generator

    Hello everyone,

    My Background: I am a novice C programmer. I simply bought a book* and am trying to teach my self out of general interest in computer science.

    My Trouble: As an exercise, I...
Results 1 to 14 of 14