CareerCup

#include <iostream>
#include <unistd.h>

using namespace std;

int main(void) {
	int* startMemoryAddress = (int*)sbrk(0);
	int* x = new int;
	int* endMemoryAddress = (int*)sbrk(0);
	cout << "heap allocated: " << (endMemoryAddress - startMemoryAddress)  << " bytes" << endl;
	delete x;
	return 0;
}


output: heap allocated: 33792 bytes

yes, i also could not understand your logic....can do this in c language.

I think the logic used by free(p)-->where p points to dynamically allocated memory.
who knows how much memory to free will be used,

brk() and sbrk() change the location of the program break, which
defines the end of the process's data segment (i.e., the program break
is the first location after the end of the uninitialized data segment).
Increasing the program break has the effect of allocating memory to the
process; decreasing the break deallocates memory.

Calling sbrk() with an increment of 0 can be used to find the current location of the program break.

Ur approach is simple n good, but have few questions

How to manage memory fragmentation?
How you manage if someone frees the memory in between

The best way to do this by intercepting malloc/free calls (in C).