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

struct linkedlist {
   int data;
   struct linkedlist *next;
};
typedef struct linkedlist *list;

list l;

void init(list l) {
   l = NULL;
}

void top() {
   list p;
   p = (list)malloc(sizeof(list));
   printf("Donner First Int : ");
   scanf("%d",&p->data);
   p->next = l;
   l = p;
}

void bck() {
   list q,p = l;
   while(l->next != NULL)
      l = l->next;
   q = (list)malloc(sizeof(list));
   printf("Donner Int : ");
   scanf("%d",&q->data);
   q->next = NULL;
   l->next = q;
   l = p;
}

void tri() {
   list p,q,min,aux;
   p = l;
   while(l->next != NULL) {
      min = l;
      q = min->next;
      while(q != NULL) {
         if(q->data < l->data)
            min = q;
         q = q->next;
      }
      int x = l->data;
      l->data = min->data;
      min->data = x;
      l = l->next;
   }
   l = p;
}

void aff() {
   list p = l;
   while(p != NULL) {
      printf("%d ",p->data);
      p = p->next;
   }
}

int main() {
   init(l);
   top();
   for(int i = 0; i < 3; i++)
      bck();
   tri();
   aff();
}