Skip to main content

Sorting in Linked List


#include<stdio.h>
#include<conio.h>

 void inst_end();
 void traverse();
 void sorting();

 struct node
 { int num;
   struct node *next;
 }*start=NULL;

 typedef struct node node;
 typedef struct node* nptr;

 void main()
 { char choice;
   while(1)
   {
   clrscr();
   printf("-------LINKED LIST-------\n\n");
   printf(" 1.Insertion \n");
   printf(" 2.Sorting\n");
   printf(" 3.Traverse\n");
   printf(" 4.Exit\n\n");
   printf(" Enter your choice: ");
   fflush(stdin);
   scanf("%c",&choice);
   switch(choice)
   { case '1': inst_end();
      break;
     case '2': sorting();
      break;
     case '3': traverse();
      break;
     case '4': exit(0);
     default: printf("\n\ninvalid choice");
   }
   getch();
 }
 }

   void inst_end()
  { int item;
    nptr p;
    p=(nptr)malloc(sizeof(node));
    printf("\nenter the item: ");
    scanf("%d",&item);
    p->num=item;
    if(start==NULL)
    { p->next=start;
      start=p;
    }
    else
    { nptr q;
      q=start;
      while(q->next!=NULL)
      { q=q->next;
      }
      q->next=p;
      p->next=NULL;
    }
  }

  void sorting()
  { nptr p,q;
    int temp;
    p=q=start;
    while(p->next!=NULL)
    { q=p->next;
      while(q!=NULL)
      { if(p->num>q->num)
{ temp=p->num;
 p->num=q->num;
 q->num=temp;
}
       q=q->next;
      }
      p=p->next;
    }
  printf("\nSorting is done successfully");
 }

   void traverse()
   { if(start==NULL)
     { printf("\nempty");
     }
     else
     { nptr p;
       p=start;
       while(p!=NULL)
       { printf(" %d",p->num);
p=p->next;
       }
     }
   }

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};