//SORTOWANIE B¤BELKOWE
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

int tab[100];
int i,n,k;


void main(void){
clrscr();
printf("Podaj ilo˜† element¢w tablicy (max 100): ");scanf("%d",&n);
printf("\nPodaj zakres k (<0-k>): ");scanf("%d",&k);
randomize();
for (i=0;i<n;i++) {tab[i]=(rand()%(k+1));}
textcolor(YELLOW);
printf("\nZawarto˜† tablicy (nr elementu - ");cprintf("element");printf("):\n");
for (i=0;i<n;i++) {
printf("%d - ",i+1);cprintf("%d",tab[i]);printf(" ;");
}

//Sortowanie
int j=n,pom;
do {
j--;
for (i=0;i<j;i++) {
 if (tab[i]>tab[i+1]) {
   pom=tab[i];
   tab[i]=tab[i+1];
   tab[i+1]=pom;
   } //koniec if
 } //koniec for

} while (j>0);

printf("\n\nZawarto˜† tablicy po sortowaniu (nr elementu - ");cprintf("element");printf("):\n");
for (i=0;i<n;i++) {
printf("%d - ",i+1);cprintf("%d",tab[i]);printf(" ;");
}
textcolor(WHITE);
getch();

} //koniec main