Breaking News: Grepper is joining You.com. Read the official announcement!

Consider an existing linked list of n number of nodes containg integer data. For an application, it is very important to know how many nodes are there containing prime number in their data part. Develop a function accomplish the said task.

isuro answered on November 20, 2023 Popularity 1/10 Helpfulness 1/10

answer Consider an existing linked list of n number of nodes containg integer data. For an application, it is very important to know how many nodes are there containing prime number in their data part. Develop a function accomplish the said task.

Consider an existing linked list of n number of nodes containg integer data. For an application, it is very important to know how many nodes are there containing prime number in their data part. Develop a function accomplish the said task.

Comment

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

// Node structure
struct Node {
    int data;
    struct Node* next;
};

// Function to determine if a number is prime
int isPrime(int num) {
    if (num <= 1) {
        return 0; // 0 and 1 are not prime
    }

    for (int i = 2; i <= sqrt(num); ++i) {
        if (num % i == 0) {
            return 0; // Not prime if divisible by any number from 2 to sqrt(num)
        }
    }

    return 1; // Prime
}

// Function to count the number of nodes containing prime numbers in their data part
int countNodesWithPrime(struct Node* head) {
    int count = 0;
    struct Node* current = head;

    while (current != NULL) {
        if (isPrime(current->data)) {
            count++;
        }

        current = current->next;
    }

    return count;
}

// Function to free the memory allocated for the linked list
void freeList(struct Node* head) {
    struct Node* temp;
    while (head != NULL) {
        temp = head;
        head = head->next;
        free(temp);
    }
}

// Example usage
int main() {
    // Create an example linked list
    struct Node* head = (struct Node*)malloc(sizeof(struct Node));
    head->data = 5;
    head->next = (struct Node*)malloc(sizeof(struct Node));
    head->next->data = 10;
    head->next->next = (struct Node*)malloc(sizeof(struct Node));
    head->next->next->data = 7;
    head->next->next->next = NULL;

    // Count the number of nodes containing prime numbers
    int primeNodeCount = countNodesWithPrime(head);

    // Print the result
    printf("Number of nodes containing prime numbers: %d\n", primeNodeCount);

    // Free the memory allocated for the linked list
    freeList(head);

    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: chat.openai.com

Tags: c function integer linked-list n nodes

Link to this answer
Share Copy Link

Contributed on Nov 20 2023

isuro

0 Answers Avg Quality 2/10

Consider an existing linked list of n number of nodes containg integer data. For an application, it is very important to know how many nodes are there containing prime number in their data part. Develop a function accomplish the said task.

Contents

More Related Answers

Consider an existing linked list of n number of nodes containg integer data. For an application, it is very important to know how many nodes are there containing prime number in their data part. Develop a function accomplish the said task.

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.