Skip to main content

C Program to create sorted single linked list from given unsorted array


shiv@ubuntu:~/ds/list$ cat  tarr_to_sortlist.c 
/*
 * Program to create sorted list from given unsorted array
 */
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define MAX 10


struct list {
int d;
struct list *next;
};


int main()
{
 /* example array to test program */
 int a[MAX]={4,1,5,6,10,9,3,2,7,8};
 int  i;
 struct list *head=NULL, *temp, *insert;
/*loop to get all array elements*/
for(i=0;i<MAX;i++) {
temp= malloc(sizeof(struct list));
if (temp == NULL) {
        printf("Can't allocate memory\n");
        exit(0);
}
temp->d = a[i];
temp->next = NULL;
   /* first node in list */
   if( head == NULL) {
      head = temp;
   } else {
       /* second node in the list */
       if( head->next == NULL){
           if(head->d > temp->d){
              temp->next = head;
              head= temp;
           } else {
                  head->next = temp; 
          }
          continue;
       } 
     insert = head;
           /* we need to stop at node before the greater value node, 
               to insert new node  before it, at single linked list, 
               if you stop at greater value node and want insert before it,
               it is not possible directly  so it is insert->next->d
            */
     while(insert->next && (insert->next->d < temp->d)) {
               if(insert->next->next == NULL)
                 break;
             insert=insert->next;
     }
    /* as list is sorted until if new element last insert->next->d
   * is less than the current node to be inserted, current is next last node
   */
  if((insert->next->next == NULL) && (insert->next->d < temp->d)) {
        insert=insert->next;
       insert->next = temp;
  } else {
              /* insert after the current node */
      temp->next = insert->next;
      insert->next = temp;
    }
  }
 }
 printf("The sorted list is \n");
 /* to display values in list to test program is working? */
 while(head !=NULL){
       printf("%d\n", head->d);
       head= head->next;
 }
}
/* end of the program */

sample out of the program below
Labels:

Comments

Post a Comment

Popular posts from this blog

C Program to Simulate Linux Cat command

/*  * C program to Simulate Implementation of  Linux *cat* command  * This program will not handle redirection  * you can try to improve this program to handle redirection of file contents  */ #include<stdio.h> #include<string.h> #define MAX_FILE_NAME_CHARS 255 int main(int argc, char *argv[]) {  FILE *fp;  char file_name[MAX_FILE_NAME_CHARS], ch;  int i;  /*   * after creating a.out, rename it as mycat for our own cat command   * and it usage is same as standard cat command   */  if(argc<1){     printf("Usage mycat <filename> \n");     return 0;  }  /*   * cat handles more than one file   * so we need this loop to handle all the files provided   * on command line   */  for(i=1; i<=argc;i++){     /* no need of copy but for understanding purpose, i have created      * str...
4 comments
Read more

simple program to create Orphan process

shiv@ubuntu:~/ds/unix$ cat  orp.c /*  * Program to create orphan process @ Linux  * getpid() gives process PID and   * getppid() gives process's parent ID   * here main() process ID is parent id is current shells PID  * once process becomes orphan it is adopted by init process(it's PID is 1)  */   #include<stdio.h> #include<unistd.h> int main() {  pid_t p; /* create child process */  p=fork();  if(p==0) {     /* fork() returns Zero to child */     sleep(10);  }  printf("The child process pid is %d parent pid %d\n", getpid(), getppid()); /*parent/child waits for 20 secs and exits*/  sleep(20);  printf("\nProcess %d is done its Parent pid %d...\n", getpid(), getppid());  return 0; } O/p shiv@ubuntu:~/ds/unix$ ./a.out The child process pid is 2575 parent pid 1922 The child process pid is 2576 parent pid 2575 Process 2575 is done it...
3 comments
Read more

C Program to find Armstrong numbers between range m and n

/*  * Program to print Armstrong number between range m and n  * Armstrong  number is nothing but sum of cubes of digits of number is  * equal to the number  * ex: 153 is Armstrong number since 1^3+5^3+3^3=153  * there are very few numbers hold above property; execute   * below program to find all numbers  * b/w m and n  */ #include <stdio.h> void is_armstrong(int num) {   int sum=0, n, d;   n=num;   while(n){   d=n%10;  /* extract digits of number*/   sum=sum+(d*d*d);  /*take sum of them */   n=n/10;  }  if(sum == num)  /*sum is same as number then it is Armstrong number*/     printf("%d\n", sum); } int main() { int i,n,m; printf("Enter range \n"); scanf("%d%d", &m, &n);  for(i=m;i<=n;i++){    is_armstrong(i);  } return 0; }
2 comments
Read more