int main()
{
unsigned n, ch;
int a[50];
n=0;
do{
puts("What would you like to do?");
puts(" ( 0) Exit");
puts(" ( 1) Populate Array");
puts(" ( 2) Print Array");
puts(" ( 3) Bubble Sort");
puts(" ( 4) Insertion Sort");
puts(" ( 5) Selection Sort");
puts(" ( 6) Quick Sort");
puts(" ( 7) Merge Sort");
scanf(" %u%*c", &ch);
switch(ch){
case 0:
puts("Bye!");
break;
case 1:
accept(a, &n);
break;
case 2:
display(a, n);
break;
case 3:
bubsort(a, n);
display(a, n);
break;
case 4:
inssort(a, n);
display(a, n);
break;
case 5:
selsort(a, n);
display(a, n);
break;
case 6:
qiksort(a, n);
display(a, n);
break;
case 7:
mrgsort(a, n);
display(a, n);
break;
default:
puts("Incorrect Choice!");
break;
}
putchar('\n');
} while(ch);
putchar('\n');
return 0;
}
void main()
{
int n,a[19];
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
selsort(a,n);
for(i=0;i<n;i++)
cout<<a[i] ;
getch();
}
void qssort(int *arr, int l, int r, int m) {
int mid = 0;
while (l < r) {
if((r - l) <= m) {
selsort(arr, l, r);
return;
}
mid = part(arr, l, r);
if ((l - mid) < (r - mid)) {
qssort(arr, l, mid, m);
l = mid + 1;
} else {
qssort(arr, mid + 1, r, m);
r = mid;
}
}
}
