The "Freeola Customer Forum" forum, which includes Retro Game Reviews, has been archived and is now read-only. You cannot post here or create a new thread or review on this forum.
right, I need to write a program which removes the the 4 bits from the left of two usigned char variables, then compares the two new variables. The higher number has to have a 1 places in the left most bit, without effecting the numbers in the rest of the variable......
Anyone any ideas on how?
Anyone any ideas on how?
If you have any problems post them in here. I'll do my best to try help a little but not sure if I will be able to offer any help. But i'll try.
Hmmm, it's of fixed length because it's an unsigned char, only 8 bits long. the first 4 record the score of the hand, then next two the number of cards, the next one whether or not there was an ace and the last for the winner.
I have all the other things up and running, I just can't get them to compare without altering all the other bits in the number, but it's ok, I have it sussed..............
I think.
I have all the other things up and running, I just can't get them to compare without altering all the other bits in the number, but it's ok, I have it sussed..............
I think.
Has it to be done using C??
If so it sounds tricky but i would imagine that it is done using pointers.
If so it sounds tricky but i would imagine that it is done using pointers.
Have each seperate character as a variable and then make the final variable a combination of the characters. I know what I mean, even if it's not that clear. Is the variable of a fixed length?
right, I need to write a program which removes the the 4 bits from the left of two usigned char variables, then compares the two new variables. The higher number has to have a 1 places in the left most bit, without effecting the numbers in the rest of the variable......
Anyone any ideas on how?
Anyone any ideas on how?