Write a c program on 2D array to Increase & Decrease elements in the subarrays

 #include <stdio.h>

#include <stdlib.h>


// Function to increase the number of elements in a specific row of a 2D array

void increaseElementsInRow(int** array, int row, int currentCols, int newCols) {

    array[row] = (int*)realloc(array[row], newCols * sizeof(int));

    for (int j = currentCols; j < newCols; j++) {

        array[row][j] = 0; // Initialize new elements with 0

    }

}


// Function to decrease the number of elements in a specific row of a 2D array

void decreaseElementsInRow(int** array, int row, int newCols) {

    array[row] = (int*)realloc(array[row], newCols * sizeof(int));

}


// Function to print the 2D array

void printArray(int** array, int rows, int* cols) {

    for (int i = 0; i < rows; i++) {

        for (int j = 0; j < cols[i]; j++) {

            printf("%d ", array[i][j]);

        }

        printf("\n");

    }

}


int main() {

    int rows = 3;

    int cols[3] = {3, 3, 3}; // Initial number of columns in each row

    int** array = (int**)malloc(rows * sizeof(int*));

    

    // Initialize the array with some values

    for (int i = 0; i < rows; i++) {

        array[i] = (int*)malloc(cols[i] * sizeof(int));

        for (int j = 0; j < cols[i]; j++) {

            array[i][j] = i * cols[i] + j + 1; // Initialize with some values

        }

    }


    printf("Original array:\n");

    printArray(array, rows, cols);


    // Increase the number of elements in the second row

    int newCols = 5;

    increaseElementsInRow(array, 1, cols[1], newCols);

    cols[1] = newCols;

    printf("Array after increasing elements in the second row:\n");

    printArray(array, rows, cols);


    // Decrease the number of elements in the first row

    newCols = 2;

    decreaseElementsInRow(array, 0, newCols);

    cols[0] = newCols;

    printf("Array after decreasing elements in the first row:\n");

    printArray(array, rows, cols);


    // Free the allocated memory

    for (int i = 0; i < rows; i++) {

        free(array[i]);

    }

    free(array);


    return 0;

}

Comments

Post a Comment

Popular posts from this blog

Write a c program to Create a Circular Linked list and perform Following Operations A. Insertion At Beginning B. Insertion At End C. Insertion After a particular node Insertion Before a particular node E. Insertion at specific position F. Search a particular node G. Return a particular node H. Deletion at the beginning I. Deletion at the end J. Deletion after a particular node K. Deletion before a particular node L. Delete a particular node M. Deletion at a specific position

#include <stdio.h> #include <stdlib.h> // Define the structure for a node in the linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the beginning of the linked list void insertAtBeginning(struct Node** head, int data) {     struct Node* newNode = createNode(data);     newNode->next = *head;     *head = newNode; } // Function to insert a node at the end of the linked list void insertAtEnd(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         *head = newNode;         return;     } ...
Read more

Write a c program to check whether the created linked list is palindrome or not

 #include <stdio.h> #include <stdlib.h> #include <stdbool.h> // Define the structure for a node in the linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the end of the linked list void insertAtEnd(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         *head = newNode;         return;     }     struct Node* temp = *head;     while (temp->next != NULL) {         temp = temp->next;     }     temp->next = newNode; } // Function to print the ...
Read more

Write a c program to Create a Circular single Linked list and perform Following Operations A. Insertion After a particular node B. Insertion Before a particular node C. Search a particular node D. Return a particular node E. Deletion before a particular node F. Delete a particular node

 #include <stdio.h> #include <stdlib.h> // Define the structure for a node in the circular linked list struct Node {     int data;     struct Node* next; }; // Function to create a new node with given data struct Node* createNode(int data) {     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));     newNode->data = data;     newNode->next = NULL;     return newNode; } // Function to insert a node at the beginning of the circular linked list void insertAtBeginning(struct Node** head, int data) {     struct Node* newNode = createNode(data);     if (*head == NULL) {         newNode->next = newNode;         *head = newNode;     } else {         struct Node* temp = *head;         while (temp->next != *head) {             temp = temp->next;   ...
Read more