/*
 * Sorteeritud massiivi loomine kohe andmetesisestamise käigus.
 */
#include <stdio.h>
#define MAXN 10

void main(void){

 int data[MAXN] = {0};
 int i, j, number, k;
 
 for (i = 0; i < MAXN; i++) {
    printf("\n\nSisesta järgmine arv ");
    scanf("%d", &number);
    printf("Lisatav %d\n", number);
    j = i;
    while (data[j - 1] > number && j > 0) { 
	    data[j] = data[j - 1];
    	j--;
    }
     data[j] = number;
     for (k = 0; k < MAXN; k++) {  
          printf("%d ", data[k]);
     
     }
 }