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

int tab[100];
int i,n,k;
int ind_dol,ind_gor;
char zn;
void sort(int tab[100], int ind_dol,int ind_gor,char zn);

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(" ;");
}

printf("\nPodaj indeks dolny: ");scanf("%d",&ind_dol);
printf("Podaj indeks g¢rny (maksymalnie %d): ",n-1);scanf("%d",&ind_gor);
printf("\n\nWybierz spos¢b posortowania element¢w tablicy:\n");
textcolor(5);cprintf("1");printf(". Rosn¥co\n");
cprintf("2");printf(". Malej¥co");
zn=getch();

sort (tab,ind_dol,ind_gor,zn);

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

} //koniec main

void sort(int tab[100], int ind_dol,int ind_gor, char zn) {
//Sortowanie
int j=ind_gor,pom;
switch (zn) {
case '1': {
do {

for (i=ind_dol;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
j--;
} while (j>0);
} //end case

case '2':{
do {

for (i=ind_dol;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
j--;
} while (j>0);
} //end case

} //end switch


} //end sort