SHOW:
|
|
- or go back to the newest paste.
| 1 | #include<stdio.h> | |
| 2 | #include<stdlib.h> | |
| 3 | #include<limits.h> | |
| 4 | ||
| 5 | ||
| 6 | void input_num(); | |
| 7 | void sort(); | |
| 8 | void print(); | |
| 9 | ||
| 10 | int ar[100], i, j, n, k, t, tmp; | |
| 11 | ||
| 12 | void input_num() | |
| 13 | {
| |
| 14 | for(i = 1; i<=n; i++) | |
| 15 | {
| |
| 16 | ar[i] = rand()%100; | |
| 17 | } | |
| 18 | for(i = 1; i<=n; i++) | |
| 19 | {
| |
| 20 | printf("%d ", ar[i]);
| |
| 21 | } | |
| 22 | ar[0] = INT_MIN; | |
| 23 | } | |
| 24 | ||
| 25 | ||
| 26 | void sort() | |
| 27 | {
| |
| 28 | for(j = n; j>=2; j--) | |
| 29 | {
| |
| 30 | t = 1; | |
| 31 | for(k = 2; k<=j; k++) | |
| 32 | {
| |
| 33 | if(ar[t]<ar[k]) | |
| 34 | {
| |
| 35 | t = k; | |
| 36 | } | |
| 37 | tmp = ar[j]; | |
| 38 | ar[j] = ar[t]; | |
| 39 | ar[t] = tmp; | |
| 40 | } | |
| 41 | } | |
| 42 | } | |
| 43 | ||
| 44 | ||
| 45 | ||
| 46 | void print() | |
| 47 | {
| |
| 48 | ||
| 49 | printf("\n\nAfter Sorting\n");
| |
| 50 | for(i = 1; i<=n; i++) | |
| 51 | {
| |
| 52 | ||
| 53 | printf("%d ", ar[i]);
| |
| 54 | } | |
| 55 | ||
| 56 | printf("\n\n");
| |
| 57 | } | |
| 58 | ||
| 59 | ||
| 60 | ||
| 61 | int main() | |
| 62 | {
| |
| 63 | ||
| 64 | printf("Number of elements:\n");
| |
| 65 | scanf("%d", &n);
| |
| 66 | ||
| 67 | input_num(); | |
| 68 | sort(); | |
| 69 | print(); | |
| 70 | ||
| 71 | ||
| 72 | return 0; | |
| 73 | ||
| 74 | } |