So you're saying the answer should be "two of the above" because a bad generator would be one in which each number appears exactly once, and that no four consecutive numbers are even.
Type: Posts; User: Sentral
So you're saying the answer should be "two of the above" because a bad generator would be one in which each number appears exactly once, and that no four consecutive numbers are even.
I had a typo in the numbers, it's only 1000 numbers, but I don't believe that would make a difference. My reason for A was because if you average the numbers from 1 to 1000 you get 500.5 not 499. So...
I would like it if someone could explain to me these test questions, and help me understand them better, because some are confusing me.
1) Which of the following statements about sorting 5...
Yea, Windows 7 US Online Store - Student Registration
You can get Windows 7 for $30 as long as you have a .edu email
I would probably use a structure or class, so then you can have different variables such as month, day, and year and they would be contained in a sort of "data type" that you defined.
Ok, I finally think I got it. This is my final answer.
(1/8)*n^4+(5/12)*n^3+(3/8)*n^2+(1/12)*n
O(n^4)
Ok wow, I've never seen a summation like that before. I don't know how to figure out this big-o stuff. Is that summation inside summation? Ugh this is confusing.
Hm, assuming you want me to expand...
Hm ok, I see that now. But how does this lead me to finding the Big-O notation? I thought usually this type of thing ends up in a summation formula that you multiply out and find the largest degree,...
Ok, so I get 1 + 6 + 18 + 40= 65, but I don't see how this will help me. Are you saying that I need to find the summation formula for this, and that will give me by Big-O? I don't understand.
I'm having trouble with another problem if someone can help me. It's just a variation on the previous problem. I still have to find the Big-O of the fragment.
for(int i = 1; i <= n; i++)...
I have to find the Big-O of this fragment, so it doesn't matter how much one instance will take, I just need to know the upper bounds of the run time.
I'm still confused. I think if the fragment...
Given the fragment:
for(int i=0; i < n; i++)
for(int j=0; j < (n*n); j++)
for(int k=0;k < j; k++)
sum++; Find the Big-O notation.
I'm having a little...
You are missing a brace to close the while loop. If you indented your code correctly you would have saw that.
Somali pirates.... lol. Crazy world.
I've haven't played those two, so I can't really judge them. Yea, I do agree that Morrowind was pretty lame, but Oblivion is pretty kick ass!
My favorite is the Elder Scrolls series, specifically, Elder Scrolls Oblivion for Xbox 360. It was so amazing when it first came out! The huge streaming landscape, first person sword battles, and...
You put your code between
tags :D
As such [code] yo dude im code
When you go to post, go advanced, and push the button that looks like this "#". That's the code tags
I would suggest Visual C++ Express by Microsoft since it's one of the more popular compilers, and it's free :D
You're quite close. You just need to add a few things. "cout" will be used in main to display the return value of the function. I think your teacher meant don't use "cout" within the function that is...
Your indentation is terrible, no wonder you have a problem finding errors.
The way you are trying to initialize in the first one can only be done when you are declaring an array, which is why the first one works. In order to initialize after you declare it, you must do it...
What are you talking about? I love spam! I can't wait to buy the cheapest drugs on the Internet :D
Well I've searched those two files for the SelectSpawnPoint function, and I haven't seen it called with 3 arguments. I've only seen it called and defined as having 2 arguments, unless I'm missing...
The code you provided is not a call, but a prototype. Yes, you should be able to call the function using 2 or 3 arguments provided they are the correct type for that function.