Question

Please do in C please. Edit sliding.c. Comments on code would be nice. Thank you.

Input: Seed, M, N Output: Printout of the array Example 1: Seed 123, M-10, N7 123 10 7 Initial grid: Shifted grid: 2 -1 2 2 1 1 2 1 2-1 1 1 2-1 1 1 2-1 -1 2 2 2 2-1-1 1 2 1 2 -1 2-1 2 2-1 2 2 2 1 2 2 2 1-1 1 1 1 2 -1 2 2 2 2 1 1 2 2 1 2 1 1 2 2 2 2 2 1 1 2 1 2 2 2 1 2 2 2 1 2 1 1 2 2-1 1-1 2 1 1 2 -1 1-12 2 1 2 -1 1-1-1-12 1-1 1-1 2 1 1 2 -1 1 2 2 2 21 -1 There are several ways achieve the same results. You are free to implement this lab using any algorithm of your choosing, as labs are graded purely on functionality. However, we suggest the following algorithm for your consideration, specifically noting that within the MP description we provide additions to this algorithm that can allow for combining of like terms: Suggested Algorithm For each of the N columns in the MxN matrix: . For each of the M elements within this column If the current row value is not empty Find the first available target row (the smallest row value (in the current column) that is empty and is less than current row number) . Assuming target row is less than current row number Copy current row value into target rovw .Clear current row contents

Here is main.c

#include "sliding.h"
#include <malloc.h>
#include <stdlib.h>

//Prints grid in row major order.  Tries to ensure even spacing.
void print_grid(int * my_array, int rows, int cols){
        int i,j;
        for(i=0; i<rows; i++){
                for(j=0; j<cols; j++){
                        if(my_array[i*cols + j]!=-1){
                                printf(" %d ", my_array[i*cols + j]);
                        }
                        else{
                                printf("%d ", my_array[i*cols + j]);
                        }
                }
                printf("\n");
        }
}

int main(int argc, char *argv[])
{
        int seed,rows,cols;
        char buf[200];
        char garbage[2];
        //Get input from user as (seed rows columns)
        printf("Please provide input as: seed rows columns\n");
        if (NULL == fgets(buf,200,stdin)) {
                printf("\nProgram Terminated.\n");
                return 2;
        }

        //Checks input for validity
        if (3 != sscanf(buf,"%d%d%d%1s",&seed,&rows,&cols,garbage) ||
        rows < 0 || cols < 0){
                printf("Invalid Input\n");
                return 2;
        }

        //Seeds the random number generator
        srand(seed);

        //Allocate array grid
        int * my_array = (int *)malloc(rows*cols*sizeof(int));

        //Populate grid with random values -1, 1 and 2
        int i,j;
        for(i=0; i<rows; i++){
                for(j=0; j<cols; j++){
                        if(rand()%3 < 2){
                                my_array[i*cols + j] = rand()%2+1;
                        }
                        else{
                                my_array[i*cols + j] = -1;
                        }
                }
        }

        //Print initial grid
        printf("Initial grid: \n");
        print_grid(my_array, rows, cols);

        //Call sliding function
        slide_up(my_array, rows, cols);

        //Print resulting grid
        printf("Shifted grid: \n");
        print_grid(my_array, rows, cols);
        free(my_array);

        return 0;
}

Here is sliding.c:

#include "sliding.h"
/*  Slide all values of array up
*/
void slide_up(int* my_array, int rows, int cols){

    return;
}

Here is sliding.h:

#ifndef SLIDING_H
#define SLIDING_H
void slide_up(int* my_array, int rows, int cols);

#endif

Answer 1

Edited sliding.c :

#include "sliding.h"
/* Slide all values of array up
*/

//the algorithm used is suggested algorithm
void slide_up(int* my_array, int rows, int cols){

   //for each column in the matrix(Note: 'j' is used for column)
   for(int j = 0 ; j < cols; j++)
   {
       //for each rows in matrix(Note: 'i' is used for rows)
       for(int i = 0; i < rows; i++)
       {
           //check if current row is not empty
           if( my_array[i*cols + j] != -1)
           {
               //finding the next target row(smallest row value (in current column) that is empty and less than current row number)
               //for that we loop from i=0 to current row
               //and check if it is empty
               for(int k = 0; k < i; k++)
               {
                   if(my_array[k*cols + j] == -1)
                   {
                       //empty, so assign the value to target row
                       my_array[k*cols + j] = my_array[i*cols + j];
                       //clearing current value
                       my_array[i*cols + j] = -1;
                       //break from the loop
                       break;

                   }
               }

           }
       }
   }

    return;
}

//==========NOTE :

//=========NO CHANGES MADE TO main.c and sliding.h

//Sample Output

Please provide input as: seed rows columns
123 10 7
Initial grid:
2 -1 2 2 1 1 2
-1 2 -1 1 1 2 -1
-1 1 2 -1 -1 2 2
2 2 -1 -1 1 2 1
2 -1 2 -1 2 2 -1
2 2 2 1 2 2 2
-1 -1 1 1 1 2 -1
1 -1 -1 1 -1 1 -1
-1 -1 2 1 1 2 -1
-1 2 2 2 2 -1 -1
Shifted grid:
2 2 2 2 1 1 2
2 1 2 1 1 2 2
2 2 2 1 1 2 1
2 2 2 1 2 2 2
1 2 1 1 2 2 -1
-1 -1 2 1 1 2 -1
-1 -1 2 2 1 2 -1
-1 -1 -1 -1 2 1 -1
-1 -1 -1 -1 -1 2 -1
-1 -1 -1 -1 -1 -1 -1