printf("[%d %d %d %d %d]\n", buf[0], buf[1], buf[2], buf[3], buf[4]);
int shift = 0;
for(shift = MAX_BOARD_POS - 1; shift >= 0; shift--){
if(buf[abs(shift)]){
break;
}
}
printf("%d\n", shift);
memcpy(_vector+shift, buf, (MAX_BOARD_POS - shift)*sizeof(*buf));
memcpy(_vector, buf+(MAX_BOARD_POS-shift), shift*sizeof(*buf));
printf("[%d %d %d %d %d]\n", _vector[0], _vector[1], _vector[2], _vector[3], _vector[4]);
Say I have an integer array like such
#define MAX 5
int bar [MAX] = {0};
int foo [MAX] = {3,1,0,0,0};
Now I'd like to shift this array so that all null entries are to the left, i.e. bar = {0,0,0,3,1}.
I thought I could do this by
Finding the number of shifts I must perform
Using memmove() t...
