GitHub - Alexandre-Raph-Pereira/BSQ: an algorithm who find the biggest square in a map of '*' where the 'o' are the obstacle and then fill the square with 'X' and display the map

Alexandre-Raph-Pereira / BSQ Public

an algorithm who find the biggest square in a map of '*' where the 'o' are the obstacle and then fill the square with 'X' and display the map

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
include		include
lib/my		lib/my
map		map
Makefile		Makefile
disp_biggest_square.c		disp_biggest_square.c
disp_square.c		disp_square.c
fs_print_first_line.c		fs_print_first_line.c
load_2d_arr_from_file.c		load_2d_arr_from_file.c
load_file_in_mem.c		load_file_in_mem.c
main.c		main.c