C Programming | Forum profile

Quote: Originally Posted by evangela so I fixed the bogus number problem by removing the & before the n in the print statement. I suggest that you compile with warnings turned on to a suitable high level (e.g., at least the -Wall option for gcc and at least the /W3 option for MSVC). This should result in a warning that reveals that you did not finish doing what quzah suggested.

If you need to copy (hint: *copy* ), some char's over to the new entry name array's, then maybe use a function from the standard library that copies strings. Or should I say, if you had a *string* and you needed to *copy* some char's over ...

scanf wants pointers. So you need to pass it the address of [b]n[/n], not the value of [b]n[/n]. (The value of n is unspecified, because you didn't initialize it. Code: scanf( "%d", & n ); Quzah.

I would guess this is a sort of typo. It should read "const char**". "const" means the value of the variable will not be modified after it is declared and initialized. A "char **" is a pointer to a pointer, usually (and definately, in this case), an array of pointers to strings. The reason it is done this way is because the list can be of any length. The last pointer needs to be NULL. The...

Quote: Originally Posted by itCbitC It'll be stored on the stack only if it is defined inside of a function. If it's outside of any function then it'll be stored in the data segment. Can you tell me if there's any restrinction on size of data segment just like there's on stack(1-2MB)?

Quote: Originally Posted by C_ntua Some minor optimizations Code: int dis; .... //in for-loop dis = distance(myPoints[i], myPoints[j]); if (result > dis) result = dis; dis will be a variable so you won't calculate twice distance Code: double distance (point a, point b){ int t1 = a.x-b.x; int t2 = a.y-b.y; return sqrt(t1*t1, t2*t2); } so you avoid computing a.x-b.x and a.y-b.y twice. Though, the compiler would probably optimize the...

You should not rely on its ascii representation nor use it anywhere in the program because it is difficult to understand what it means. You can use is_digit to check if it is indeed a number. Then you can subtract by '0' to get the "real" number in integer format. Example: c = getchar(); c -= '0'; Do NOT subtract by 48. It's known as a magic number. A number thrown in somewhere which you might not...

By far the greatest simplification you can make to that code would be to use recursion and have the code pass a pointer-to-a-pointer to the node rather then just a single-pointer, so that none of the code has to know whether the node being deleted comes from a left or a right of a node or from the root. Instead it just NULLs whatever was passed in. This is a minimal example to demonstrate that concept, and is meant to contain memory leaks...

you have to use any sorting algorithm. And take a counter which will take care of -1 and at the end concatenate all the -1 in to the array at end of it.

Quote: Originally Posted by BEN10 You can do like this Code: #define MAX1 785 #define MAX2 106 char a[MAX1][MAX2]; Can I assign MAX1 VARIABLE equal 100000000000? what is maxium value of MAX1 ?