#include <stdio.h>
    struct element {
           int info; 
           struct element *next;
    };

int main(void){

    struct element *head, *node, *prev, *current;
    int arv;
    
    head = NULL;
    printf("Sisesta arv! (Lõpetamiseks 0)");
    scanf("%d",&arv);
    while (arv != 0){
          node = malloc(sizeof *node); // Uus element
          node->info = arv;
          current = head;
          prev = NULL;
          while (current != NULL && current->info < arv) {
                prev = current;
                current = current->next;
                }
          if (prev == NULL){ //Lisamine algusesse
             node->next = head;
             head = node;
             }
          else {         //Lisamine keskele Current ja Prev vahele või lõppu}
               prev->next = node;
               node->next = current;
               }
          current = head;
          while (current != NULL){
                printf("%d",current->info);
                current = current->next;
                }
          
          printf("Sisesta arv! (Lõpetamiseks 0)");
          scanf("%d",&arv);
    }
}