Array In Ascending Order

In this blog, you will learn about an array in an ascending order.

Introduction

• The array in an ascending order is often necessary to arrange the elements in an array in the numerological order i.e. from the lowest values to the highest values. 

Software Requirements

• Turbo C++ OR C. 

Programming

** ** ** ** ** ** ** ** ** ** ** ** ** ** * Array in ascending order ** ** ** ** ** ** ** ** ** ** ** ** ** ** **
#include < stdio.h > void main()
{
        int i, j, a, n, number[30];
        printf("Enter the value of N \n");
        scanf("%d", & n);
        printf("Enter the numbers \n");
        for (i = 0; i < n; ++i) scanf("%d", & number[i]);
        for (i = 0; i < n; ++i) {
            for (j = i + 1; j < n; ++j)
            {
                if (number[i] > number[j])
                {
                    a = number[i];
                    number[i] = number[j];
                    number[j] = a;
                }
            }
            printf("The numbers arranged in ascending order are given below \n");
            for (i = 0; i < n; ++i) printf("%d\n", number[i]);
        }

 

Explanation

• In the programming, given above, I have clearly explained and the array in an ascending order is printed.

Output

Conclusion

•  Thus, the array in an ascending order has printed and executed successfully from the lowest to the highest value.