I have an array, int deck[52]. I want to make the values:

deck[0] = 1;
deck[1] = 1;
deck[2] = 1;
deck[3] = 1;
deck[4] = 2;
deck[5] = 2;
deck[6] = 2;
deck[7] = 2;
deck[8] = 3;

And so on, every four increment by one. I have tried several times and cannot get the idea in my head. Can someone show me the proper way to do this?

Just banging this out quick, but...

The deck[0] part's cuz I can't recall how smth%0 works...

int i,j;
i=1;
j=1;
deck[0] = j;
for(i;i

int i;

for(i = 0; i < 52; i++) {
deck[i] = i / 4 + 1;
}

The + 1 is because you wanted it to start with 1, not 0

can you do something like:

array = {1,1,1,1,2,2,2,2,3};

? i think thats how you do it. thats how it works in perl at least

Flikm: and how do you fill it?

I think Govt's solution is the best and simple one
[addsig]

Better solution:

int i,j=0;

for(i=0;i[ This Message was edited by: robost86 on 2002-02-05 09:37 ]

--> I think Govt's solution is the best and simple one

Hehe - good enough for coder of the month, then?

muhahaha... =P

Thanks, both of you

Govtcheez: but my solution is faster

btw, his solution is _not_ the best, it's not even good in fact. Everyone using division/modulo in a loop like that should read his C book again

robert: we don't use stone-aged PCs like you anymore

[addsig]

That's good for you, because "What your brain can't do, you PC will have to do"

A Pentium 200MHz with MMX (tm) technology is not from the stone age, by the way.

hey, stop posting 2 posts in a line!
ok, it might be not from the stone-age, but it's old enough to care about performance, yes
I love to care about performance tho, it's challenging, and also funny. No, I mean it. Guess why I'm progging OpenGL stuff... you always need maximum performance for the rendering, so you should keep the main code as fast as possible
I really love that =D
[addsig]

AFAIK loops are the most perfomance-influencing (is there a better way to put it?) parts of the code. Making them PERFECT is therefor essential for every program and should be done even in small progs, no matter how many TeraHertz your box has...

Yes, of course the most used code in a program (i.e. inside loops) is the most important to improve. If you code your loops like some people in this thread have, your program will get a bit slow

I'm not gonna deny that maybe yours is better, robost, but why is it? What's so wrong with using mod in a loop?

robert said it's too slow when i asked him on irc...

hehehe - I can't believe a question this little's generating so much discussion...

Hey, I even thought this little question interesting enough to start coding an own solution instantly...

More problems like this please

ill agree with mox and robert.
and give you an example.
few months ago i coded a catalogue programm that manages 20.000+ mp3 ...
now when performing search my first algo blocked the computer when you give him only two letters, and for artis name (eg. Deep Purple) it took round 10 sec to display.
after 15 min revision of the algo it 1. doesn't block 2.takes 1-2 secs for the deep purple search

mod is actually int(x / y) * y
yes, that is two operations, therefore it takes 2x as long (assuming * and / take the same amount of time, not always, if I remeber correctly), so / is faster...

--> mod is actually int(x / y) * y

You sure?

I jsut plugged in 5%3 into that equation on a compiler and got 3...

...hmmm
modulus?
put short way , it gives the reminder of a division.

Quote:
The deck[0] part's cuz I can't recall how smth%0 works...

0 mod *smth* is always 0

almost all mathematical opreations you do with 0 are 0 in the end ...
[addsig]

0+1!=0

heh...
_almost_ all .... did you see it?
[addsig]

i bet i could come up with an infinite number of operations involving zero that do not equal zero!! haha, i love showing off my m4d maths sk1llz, lol

actually, multiplication, and division operations (LHS only) are the only ones I can think of.

apart from that, there're:
division (RHS)
addition
subtraction
indices+roots (RHS)
factorials
which don't evaluate to 0