Posts
 
Reputation
Joined
Last Seen
Ranked #1K
Strength to Increase Rep
+3
Strength to Decrease Rep
-0
100% Quality Score
Upvotes Received
2
Posts with Upvotes
2
Upvoting Members
2
Downvotes Received
0
Posts with Downvotes
0
Downvoting Members
0
1 Commented Post
0 Endorsements
Ranked #2K
~10K People Reached
Favorite Forums
Favorite Tags
c++ x 28
c x 6
Member Avatar for bman214
Member Avatar for Clueless86

No one here uses Eclipse? For Eclipse: [url]http://www.eclipse.org/[/url] For pydev (python extension for Eclipse): [url]http://pydev.sourceforge.net/[/url]

Member Avatar for Stefano Mtangoo
0
316
Member Avatar for foxmulder

It could be the -----'s you have. Unless its commented in your actual code but not in the post.

Member Avatar for Seten
0
137
Member Avatar for PDB1982

There are code snippets on daniweb. I just can't find it atm, gimme a sec to check. edit: Found it: [url]http://www.daniweb.com/code/[/url]

Member Avatar for mrnutty
0
98
Member Avatar for sabian4k

Tthats not recursion. Heres a small example, counting down from a number to 1. [CODE] void recur(int x){ if(x == 0) return; cout<<x; void recur(x-1); }[/CODE]

Member Avatar for DaBunBun
0
162
Member Avatar for DaBunBun

For some reason netbean hates me, as well as eclipse. So i set cygwin as the compiler and debugger and everything, and tried a simple print statement and all i got was: The system cannot find the path specifiedProcess is started in an external terminal ... RUN FAILED Any help …

Member Avatar for DaBunBun
0
128
Member Avatar for Mr.Magic

Theres a problem with our count variable, you end up incremented everytime regarrdless if its the largest or not, and you never reset it to 0. [CODE] if (num > largest){ largest = num; count=1;} if(num == largest) count++; [/CODE]

Member Avatar for DaBunBun
0
200
Member Avatar for DaBunBun

So I was looking over someone elses code, and the main is unusual, no type. its just: #include <math.h> main(int argc, char *argv[]) I've come up with 2 theories: 1) It defaults to int? 2) #if/#endif directives somehow negate the need for int? Have no experience with this though, so …

Member Avatar for Salem
0
130
Member Avatar for DaBunBun

So 2 questions. 1) MPI_Init. I'm trying a python -> c -> cluster project. So I have no problem with the python -> c, but the problem comes with the c-> cluster. I'm making a python wrapper (I believe this is the correct term) around a premade c driver for …

Member Avatar for DaBunBun
0
128
Member Avatar for adel_elrefaey

The number of errors you have in code doesn't dictate how close you are to finishing. It can go from 1 error -> 12 errors -> working.

Member Avatar for adel_elrefaey
0
708
Member Avatar for ryBowk

I would also recommend commenting your code. In something such as this, its not needed, but as code you write starts to get bigger and bigger, comments are a must.

Member Avatar for ryBowk
0
137
Member Avatar for mandofl

Does TotalPoints need to be a function? If not, then just run through the array summing up everyone's score. [CODE] int main() { .... int sum = 0; for (int x_var = 0; x_var <NUM_PLAYERS ;x++) sum += players[x_var]; ... }[/CODE]

Member Avatar for mandofl
0
7K
Member Avatar for bharatsinh
Member Avatar for DaBunBun

I'm working on a little code snippet and my c++ seems a bit rusty. How do i go about getting the length of an array? My eclipse is giving me weird values when it should be segfaulting, so I'm trying to figure out whats wrong. Thanks in advance. edit: forgot …

Member Avatar for mvmalderen
0
158
Member Avatar for hughesadam_87
Member Avatar for Brandon21

An alternative could be to use an array and later print out the specific pieces that you need. tux's method works a lot cleaner but if you need to pick different points the sequance for later, having it stored can be helpful. [CODE] int y = 2; int x = …

Member Avatar for DaBunBun
0
122
Member Avatar for baula

If your in academia and your university pays for it, you can also use Safari Books online. [url]http://proquest.safaribooksonline.com/[/url]

Member Avatar for DaBunBun
0
133