>...if you want to be a pedant...
To make distinctions between static, automatic and dynamic attributes - is it too pedantic for you?
;)

In C you can assign void* type pointer value to the pointer of any type without casting. So simply declare a proper type pointer and set it to the buffer:

char* pchar = buf_ptr;
char* ptr = pchar...

>short answer: static arrays are allocated when the function is called...
Short remark: static arrays are allocated before the first call of the function. However no static arrays in OP snippet....

>More random calls will tend to dilate the variance.
The variance of... what? We didn't estimate random sequence parameters in that case so the variance (or other moments) does not bear a relation...

A day ago csurfer's algorithm solved the problem. That's "pipelined" version:

int i, j = rand()%20;
for (i = 0; i < 20; i++)
array[i] = (i != j)*(rand()%9 + 1);

In addition:...

That's it:

(256 in C++)

Why strncat? Make a single (expected) string by a single snprintf call. What's a problem?

The second argument type is a pointer to a pointer to FILE type.
Didn't you understand what's a pointer?
Evidently this function returns FILE* pointer via this argument. What's a strange...

absread:
What's it: ancient TC non-standard function to read a sector from the HD in native DOS environment.
Usage: forget as soon as possible.

Excuse me, siddhant3s: I have not seen your post above! :(
No need in my post now.

According to the C and C++ standards

int array[....];

array[-2] - wrong expression, because array-2 points to inexisting array element (the only exception: pointer to the 1st element after...

More precisely: if the program attempts to modify an array corresponding to a string literal, the behavior is undefined.

Well, let f(i) is i-th member without sign (it's not C).

f(i) = i/i! = i/(1*2*...*(i-1)*i) =
i/(i*(1*2...*(i-1)) = 1/(i-1)!
f(i+1) = 1/i! = 1/((i-1)!*i) = f(i)/i
i = 1, 2,... (0! = 1 by...

See: you have fac > no for all no values because fac = n!. Therefore no/fac == 0 (integer division) and com=com+j is the same as com += 0...

1. Use double type for math calculations (not float)....

Of course, you have linker error because nobody (except you) knows such library function as concat (probably you want strcat).

The second attempt failed because fgets function puts the last '\n'...

If you mean variable argument list, read this:
http://www.codeproject.com/KB/cpp/argfunctions.aspx?fid=15556&df=90&mpp=25&noise=3&sort=Position&view=Quick&select=1066108

Start from this forum announcement: http://www.daniweb.com/forums/thread78060.html
(especially Describe your problem clearly and fully! paragraph).

Sorry, I don't understand:
>why when i do buff[i]=0;...
No such assignment in the squeeze function!
WHY and WHERE you do buff[i]=0?!

>i began reading K&R ...
Well, let's read the next sentence after squeeze function definition:

What else?
Better turn off your computer, take a sheet of paper and a pencil then try to squeeze a...

if (x - y + abs(x-y)) { /* x > y */

;)

Well, and what do you want to do with this 5-years old slops?
Better think then implement the proper solution from the scratch.

Can you present the original specification of the "remove chars" stuff (not this wittingly incorrect implementation)?

while("sMessage[x]"){

Why quotes?! ;)
It's a loop forever: while (pointer to string literal != 0). It never is null...

Try DISLIN:
http://www.mps.mpg.de/dislin/
It's free for non-commercial use.

Better post a code where [i]macro doesn't seem to work[/icode].
More accurate this substitution definition is

#define stack_empty(x) (*(x) == 0)

However it's a strange parameter type stack**....

Yet another defects (obvious):
1. The comparelist function does not compare lists, it compare two integers (now). Moreover, the 3rd parameter of equal semantically defines "compare nodes" function!...

1. Operator priorities: a<<2 + a treated as a << (2+a).
2. Undefined result; side effect of ++ operators and undefined order of argument list evaluation, cases [icode]<2>+=pow(2,2),...

Look at csurfer's post again!
It was the true solution of your problems (in other words, it was a correction of your mistake ;))...

Think about another approach:

struct IntRange { int minval, maxval; };

struct IntRange MinMax(const int* arr, int n)
{
struct IntRange range = { 0, 0 };
if (arr && 0 < n) {
...

It's wonderful but just before talking about this code run-time speed and other characteristics correct obvious errors in it. Now you can't compile this code: arr1 is not declared in the merge...

A name in C is a statically (before execution) defined program artifact, syntacticaly it's an identifier.

There are dynamically (in run-time) created and destroyed data objects and statically...

It seems it's your homework... See this forum rules... ;)
Some tips:
1. the scanner (lexical analyser) works "before" preprocessor so your 1st statement is wrong...
2. The C preprocessor is a...

Evidently it's impossible in terms of element access counter because no direct access to list elements so you need ~n/2 accesses to fetch a given number from a list - O(n) time complexity.

If n...

What is it - a file binarization?

What C compiler are you using? What's this pragma format description in the compiler manuals?

1. It DOES NOT work because you forgot to double backslashes in the file name string literal (see point #3 example in your snippet).
2. ? No platform-independent solution.
3. ShellExecute is a...

Well, and what's your problem now? Only inline and template function definitions are placed in .h files.
Look at http://www.daniweb.com/forums/thread165526.html. May be it helps...

I don't understand what's "formal function declaration". Have you ever seen informal function declarations?

That's the worst solution. Now you have a huge scrap heap of all possible interfaces. It's hard to maintain such a heap, you have drastically increased compilation time and full project recompilation...

And don't forget to terminate the last token when break the loop...