Insertion Sort Algorithm In A Singly Linked List In C Code Example


Example: insertion singly linked list in c

/**  * C program to insert a new node at the beginning of a Singly Linked List  */  #include <stdio.h> #include <stdlib.h>   /* Structure of a node */ struct node {     int data;          // Data      struct node *next; // Address  }*head;   void createList(int n); void insertNodeAtBeginning(int data); void displayList();   int main() {     int n, data;      /*      * Create a singly linked list of n nodes      */     printf("Enter the total number of nodes: ");     scanf("%d", &n);     createList(n);      printf("\nData in the list \n");     displayList();      /*      * Insert data at the beginning of the singly linked list      */     printf("\nEnter data to insert at beginning of the list: ");     scanf("%d", &data);     insertNodeAtBeginning(data);      printf("\nData in the list \n");     displayList();      return 0; }   /*  * Create a list of n nodes  */ void createList(int n) {     struct node *newNode, *temp;     int data, i;      head = (struct node *)malloc(sizeof(struct node));      /*      * If unable to allocate memory for head node      */     if(head == NULL)     {         printf("Unable to allocate memory.");     }     else     {         /*          * Input data of node from the user          */         printf("Enter the data of node 1: ");         scanf("%d", &data);          head->data = data; // Link data field with data         head->next = NULL; // Link address field to NULL          temp = head;          /*          * Create n nodes and adds to linked list          */         for(i=2; i<=n; i++)         {             newNode = (struct node *)malloc(sizeof(struct node));              /* If memory is not allocated for newNode */             if(newNode == NULL)             {                 printf("Unable to allocate memory.");                 break;             }             else             {                 printf("Enter the data of node %d: ", i);                 scanf("%d", &data);                  newNode->data = data; // Link data field of newNode with data                 newNode->next = NULL; // Link address field of newNode with NULL                  temp->next = newNode; // Link previous node i.e. temp to the newNode                                  temp = temp->next;              }         }          printf("SINGLY LINKED LIST CREATED SUCCESSFULLY\n");     } }   /*  * Create a new node and inserts at the beginning of the linked list.  */ void insertNodeAtBeginning(int data) {     struct node *newNode;      newNode = (struct node*)malloc(sizeof(struct node));      if(newNode == NULL)     {         printf("Unable to allocate memory.");     }     else     {         newNode->data = data; // Link data part         newNode->next = head; // Link address part          head = newNode;          // Make newNode as first node          printf("DATA INSERTED SUCCESSFULLY\n");     } }   /*  * Display entire list  */ void displayList() {     struct node *temp;      /*      * If the list is empty i.e. head = NULL      */     if(head == NULL)     {         printf("List is empty.");     }     else     {         temp = head;         while(temp != NULL)         {             printf("Data = %d\n", temp->data); // Print data of current node             temp = temp->next;                 // Move to next node         }     } }

Comments

Post a Comment

Popular posts from this blog

Are Regular VACUUM ANALYZE Still Recommended Under 9.1?

Answer : VACUUM is only needed on updated or deleted rows in non-temporary tables. Obviously you're doing lots of INSERTs but it's not obvious from the description that you're also doing lots of UPDATEs or DELETEs. These operations can be tracked with the pg_stat_all_tables view, specifically the n_tup_upd and n_tup_del columns. Also, even more to the point, there is a n_dead_tup column that tells, per table, how much rows need to be vacuumed. (see Monitoring statistics in the doc for functions and views related to statistics gathering). A possible strategy in your case would be to suppress the scheduled VACUUM, keeping an eye on this view and checking on which tables the n_dead_tup is going up significantly. Then apply the aggressive VACUUM to these tables only. This will be a win if there are large tables whose rows never get deleted nor updated and the aggressive VACUUM is really necessary only on smaller tables. But keep running the ANALYZE for the optimiz
Read more

Can Feynman Diagrams Be Used To Represent Any Perturbation Theory?

Answer : Diagram machinery works also for perturbation theory in classical statistical mechanics and classical field theories. Generally, various kinds of diagrams constitute a pictorial way of talking about tensor products and their contractions while hiding the multi-linear algebra from the layman. In the simplest case, vertices (or blobs) represent vectors, matrices, tensors; vertices have ingoing and/or outgoing ports; ingoing ports denote (contravariant) ro indices; outgoing ports denote (covariant) co indices; directed arcs between blobs give a pair of equal indices summed over; different base spaces ⇔ \Leftrightarrow ⇔ different arc types; symmetric tensors ⇔ \Leftrightarrow ⇔ undirected diagrams; no labels are needed for internal lines. In many cases, the directed arcs are decorated (as thin, thick, broken,wavy, curly lines), each decoration indicating the presence of a so-called propagator, a function of its label to use as a weight in the sum, which may beco
Read more