memcpy()copy the entries in an array to another in a way faster than just iterating on each element
O(N)? If the answer is yes then what do you think is its complexity ?
If the size allocated is smaller than the original size, does
realloc()copy the entries to somewhere else or just leave them as they are decreasing the size of the array ?