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