Question

Describe a parallel algorithm for computing the minimum for n numbers on a linked list.

Answer 1

If we have a linked list containing n elements and we have to find out the minimum number of all elements, we define a function suppose called minimum which takes the head of the linked list containing n elements as argument.

int minimum(Node *head)

{

if(head==NULL) return -1; //that is if the linked list is empty return -1.

Node *temp=head;

int mini=INT_MAX; //we initialise the minimum value by the largest possible integer.

while(temp!=NULL) //we traverse through the linked list

{

int x=temp->data;

if(x<mini) mini=x;

temp=temp->next;

}

return mini; //we return the minimum element

}

(If you liked my solution,Please do give an upvote.Thank You!)