Can someone help me to improve the following code in C and make it functional? #include #include void printMaze(int maze[10][10], int posX, int posY) { int i; int j; printf("\033[0;0H\033[2J"); for (i = 0; i < 10; i++) { for (j = 0; j < 10; j++) { if (i == posX && j == posY) printf("? "); else { if (maze[i][j] == 0) printf(" _ "); else printf("? "); } } printf("\n"); } } void solveMaze(int maze[10][10], int x, int y) { printf("posX: %i, posY: %i\n", x, y); if (x == 9 && y == 9) { printf("*********Resuelto*********\n"); exit(0); } if (maze[x + 1][y] == 0) return solveMaze(maze, x += 1, y); if (maze[x][y + 1] == 0) return solveMaze(maze, x, y += 1); if (maze[x - 1][y] == 0) { if (maze[x - 1][y + 1] == 0) return solveMaze(maze, x -= 1, y += 1); } } int main(void) { int option = 0; int count = 0; int maze[10][10] = { {0,0,0,0,0,1,1,1,1,1}, {1,1,1,1,0,1,0,0,0,0}, {1,1,1,1,0,1,0,1,1,0}, {1,0,0,0,0,1,0,1,1,0}, {1,0,1,1,1,1,0,1,0,0}, {0,0,1,1,0,0,0,1,0,1}, {0,1,1,1,0,1,1,1,0,1}, {0,0,0,1,0,0,0,1,0,1}, {1,1,0,1,1,1,0,1,0,0}, {1,1,0,0,0,0,0,1,1,0}}; int posX = 0, posY = 0; solveMaze(maze, posX, posY); return 0; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Can someone help me to improve the following code in C and make it functional?

#include <stdio.h>
#include <stdlib.h>

void printMaze(int maze[10][10], int posX, int posY)
{
int i;
int j;
printf("\033[0;0H\033[2J");
for (i = 0; i < 10; i++)
{
for (j = 0; j < 10; j++)
{
if (i == posX && j == posY)
printf("? ");
else
{
if (maze[i][j] == 0)
printf(" _ ");
else
printf("? ");
}
}
printf("\n");
}
}

void solveMaze(int maze[10][10], int x, int y)
{
printf("posX: %i, posY: %i\n", x, y);
if (x == 9 && y == 9)
{
printf("*********Resuelto*********\n");
exit(0);
}
if (maze[x + 1][y] == 0)
return solveMaze(maze, x += 1, y);
if (maze[x][y + 1] == 0)
return solveMaze(maze, x, y += 1);
if (maze[x - 1][y] == 0)
{
if (maze[x - 1][y + 1] == 0)
return solveMaze(maze, x -= 1, y += 1);
}
}

int main(void)
{
int option = 0;
int count = 0;
int maze[10][10] = {
{0,0,0,0,0,1,1,1,1,1}, {1,1,1,1,0,1,0,0,0,0}, {1,1,1,1,0,1,0,1,1,0}, {1,0,0,0,0,1,0,1,1,0}, {1,0,1,1,1,1,0,1,0,0}, {0,0,1,1,0,0,0,1,0,1}, {0,1,1,1,0,1,1,1,0,1}, {0,0,0,1,0,0,0,1,0,1}, {1,1,0,1,1,1,0,1,0,0}, {1,1,0,0,0,0,0,1,1,0}};
int posX = 0,
posY = 0;

solveMaze(maze, posX, posY);

return 0;

Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education