void biggestsq(char **map, t_sq *sq, int i, int j)
{
int size;
size = sq->size + 1;
while (is_sq(map, i, j, size) == 1)
{
sq->x = i;
sq->y = j;
sq->size = size;
size++;
}
}
//this pads B with 0s
void pad_0_B( int n){
int ** m = B;
if(is_sq(n))
return m;
int half = (((int)sqrt(n*1.0))+1);
int new_n = half*half;
B = allocMatrix(new_n);
for(int i = 0; i<n; i++)
for(int j=0; j<n; j++)
B[i][j]=m[i][j];
free(m);
}
int new_n(int n){
if(is_sq(n))
return n;
int half = (((int)sqrt(n*1.0))+1);
return half*half;
}
