In an interview, I was asked to write an implementation of strcpy and then fix it so that it properly handles overlapping strings. My implementation is below and it is very naiv
Note: Here, b
is the address of the source string and a
is the address of the destination.
With a > b
you wouldn't necessarily have an overlap. If
(a <= b && a+strlen(a) >= b) || (b <= a && b+strlen(b) >= a)
then you have an overlap.
However, besides detecting overlap for the sake of interview, a > b
should do fine for strcpy
. The idea is this:
If b
is placed further in the memory (b > a
), then you can normally copy b
into a
. Parts of b
will be overwritten, but you are already past that part.
If a
is placed further in the memory (a > b
), it means that possibly by writing on the first location of a
, you have already overwritten a location in b
with a higher index. In such a case, you should copy in the opposite direction. So instead of copy from index 0
to strlen(b)-1
, you should copy from strlen(b)-1
to 0
.
If you are confused how that helps, draw two overlapping arrays on paper and try to copy once from the beginning of the array and once from the end. Try this with the overlapping arrays both in cases a > b
and a < b
.
Note, if a == b
, you don't need to actually copy anything and you can just return.
Edit: I am not sure, but reading the other solutions, it seems like this answer may not be completely portable. Beware of that.