Hi,
I'm working on a program to sort students by last name, first name, middle initial, gpa, etc. I've defined a data structure called "Student."
typedef struct
{
char last[21];
...
Type: Posts; User: ridilla
Hi,
I'm working on a program to sort students by last name, first name, middle initial, gpa, etc. I've defined a data structure called "Student."
typedef struct
{
char last[21];
...
Here are the specifications of the project:
We're given a main function, which we cannot edit in any way. It does the following, in this order.
-- Initializes three variables, int...
Also, the parameters for my function are hard and fast - i have to pass in two arrays and the initialized stats data. The function doesn't check just one cell, it has to check them all in one call....
Are you sure that the square variable will go back to what it was? I know that would be true for a variable, but arrays aren't copied when they're passed from function to function, the actual array...
int
counter(count)
{
if(count = 1)
{
return;
}
else
{
the loops seem necessary to me, here's my reasoning. hopefully you can tell me why they're not necessary.
the first loop is necessary to progress through the row, provided both sub-levels turn...
quick correction to that, it should say if(row[i] == 0), not if(row[i] = 0)
Adak: here's my code. I'm assuming that the row array has already been populated with the values you posted, that your question marks are the same thing as zeroes and that the "validate" function...
Thanks again for the response.
Your recursion makes sense to me now, but I still can't seem to get it to work. Here's what I've coded
Stats
solve(int puzzle[PSIZE][PSIZE], int...
Thanks for the quick reply, I am a little confused though, concerning the statement "puzzle[x][y] = unknown". Is that part of the if statement? What's its purpose? I'm trying to follow the flow of...
Hi all,
I'm writing a sudoku-solver program for an intro class in C. I'm not asking for anyone to do my homework, don't worry. The function that I'm struggling with ("solve") is one of many called...