Q. Program to sort the elements of an array in ascending order.

Explanation

In this program, we need to sort the given array in ascending order such that elements will be arranged from smallest to largest. This can be achieved through two loops. The outer loop will select an element, and inner loop allows us to compare selected element with rest of the elements.

Original array:

Array after sorting:

Elements will be sort in such a way that smallest element will appear on extreme left which in this case is 1. The largest element will appear on extreme right which in this case is 8.

Algorithm

1. Declare and initialize an array.
2. Loop through the array and select an element.
3. The inner loop will be used to compare the selected element from the outer loop with the rest of the elements of the array.
4. If any element is less than the selected element then swap the values.
5. Continue this process till entire array is sorted in ascending order.

Solution

Python

Output:

Elements of original array: 
5 2 8 7 1 
Elements of array sorted in ascending order: 
1 2 5 7 8 

C

Output:

Elements of original array: 
5 2 8 7 1 
Elements of array sorted in ascending order: 
1 2 5 7 8 

JAVA

Output:

Elements of original array: 
5 2 8 7 1 
Elements of array sorted in ascending order: 
1 2 5 7 8 

C#

Output:

Elements of original array: 
5 2 8 7 1 
Elements of array sorted in ascending order: 
1 2 5 7 8 

PHP

Output:

Elements of original array: 
5 2 8 7 1 
Elements of array sorted in ascending order: 
1 2 5 7 8