C / C++ / MFC

int total = 100;
int unalloc = 96;
double percent = unalloc/total;

double percent = (double)unalloc/total:

double total = 1621270208;
double percentFrom = 1604667016;
double percent = percentFrom / total * 100;

void PrintFloats (int n, ...)
{
    int i;
    double val;
    printf ("Printing floats:");
    va_list vl;
    va_start(vl,n);
    for (i=0;i

for(i = 0; i < n; ++i) {
    val = va_arg(vl, float);
    printf("%f ", val);
}
va_end(vl);
putchar('\n');

PrintFloats(1.1, 2.2, -15.2, nan(""));

#include <cstdarg>
#include <iostream>

struct S {
    int data;
    S(int d) : data(d) {}
};

void f(size_t n, ...)
{
    va_list args;
    va_start(args, n);
    for(size_t i = 0; i < n; ++i) {
        S* ptr = va_arg(args, S*);
        std::cout << ptr->data << '\n';
    }
}

int main()
{
    S item1(1); 
    S item2(2);
    S item3(3); 

    f(3, &item1, &item2, &item3);
}

1. Since your code is C++ then why do you use malloc rather than new?
2. How and where do you free your allocated in heap memory?

<pre lang="C++">   SomeNode * Tail;
    Tail = (SomeNode*)malloc(sizeof(SomeNode));
    Tail->next = NULL;
    Tail->data = 100;

Quote:

One thing it is not good using malloc in C++ apps is because the class ctor is not called.

void InsertTo(SomeNode ** FrontTip, int NewNodeData, int InsertInFrontOfNodeCount, int TotalNodeCount)
{
	SomeNode * Temp;
	SomeNode * NewNode;
	SomeNode * Previous;
	NewNode = (SomeNode*)malloc(sizeof(SomeNode));
	NewNode->data = NewNodeData;

	bool firstrun = true;

	for(int i =0; i < TotalNodeCount;i++)
	{
		if(i == InsertInFrontOfNodeCount)
		{
			NewNode->next = Temp;
			Previous->next = NewNode;
		}
		else
		{
			if(firstrun)
			{
				Temp = (*FrontTip)->next;
				firstrun = false;
			}
			else
			{
				Previous = Temp;
				Temp = Temp->next;

			}
			
		}
		 
	}

}

CalinNegru wrote:

Could someone confirm I`m doing it the way I`m supposed to.

Quote:

There are multiple ways to code