{"id":10907,"date":"2022-12-05T09:47:18","date_gmt":"2022-12-05T09:47:18","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=10907"},"modified":"2023-05-10T06:36:24","modified_gmt":"2023-05-10T06:36:24","slug":"c-program-to-sort-an-array-in-ascending-order","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/c-program-to-sort-an-array-in-ascending-order\/","title":{"rendered":"Ascending Order Program in C"},"content":{"rendered":"

\"\"<\/p>\n

Ascending order refers to the arrangement of a set of numbers in increasing order, from the smallest value to the largest value. A program to sort numbers in ascending order in C can be useful for a variety of applications.<\/p>\n

The process of sorting a set of numbers in ascending order can be done using different sorting algorithms such as bubble sort, insertion sort, selection sort, and more. In general, the sorting algorithm works by comparing pairs of adjacent elements and swapping them if they are in the wrong order.<\/p>\n

Original array<\/strong><\/p>\n

5 2 8 7 1<\/code><\/pre>\n
Array after sorting<\/strong><\/p>\n
1 2 5 7 8<\/code><\/pre>\n
The order of the elements will be such that the smallest element, in this example 1, which is the smallest, will appear on the far left. On the far right, the greatest piece, in this case, 8 will be visible.<\/p>\n
Logic Used to Sort an Array<\/h2>\n
The items may be sorted using a variety of reasoning. For the sake of simplicity, we will use a standard method used in ordinary living. In order to sort an array<\/a>, we choose a certain element and position it correctly by comparing it to other components.<\/p>\n
Explanation<\/h3>\n
Take input array \u2018a\u2019 and no of elements(n) as 4<\/p>\n
Let us take elements for array a={7,8,12,3}.<\/strong><\/p>\n
1st iteration for(i=0;i<n;i++) i.e. for(i=0;0<4;i++)   \u2013 Outer for loop\n1st iteration for(j=i+1;j<n;j++)  i.e. for(j=1;1a[j])  i.e. if(a[0]>a[1]) i.e. if(7>8)  false\n2nd iteration for(j=i+1;j<n;j++)  i.e. for(j=2;2a[j])  i.e. if(a[0]>a[1]) i.e. if(7>12)  false\n\n3rd iteration for(j=i+1;j<n;j++)  i.e. for(j=3;3a[j])  i.e. if(a[0]>a[1]) i.e. if(7>3)  true\ntemp=a[i];  i.e. temp=a[0]  i.e. temp=7\na[i]=a[j];  i.e. a[0]=a[3] i.e. a[0]=3\na[j]=temp; i.e. a[3]=7<\/code><\/pre>\n
So now are array is a={3,8,12,7}<\/strong><\/p>\n
2nd iteration for(i=1;i<n;i++) i.e. for(i=1;1<4;i++)   \u2013 Outer for loop\n1st iteration for(j=i+1;j<n;j++)  i.e. for(j=2;2a[j])  i.e. if(a[1]>a[2]) i.e. if(8>12)  false\n\n2nd iteration for(j=i+1;j<n;j++)  i.e. for(j=2;2a[j])  i.e. if(a[1]>a[3]) i.e. if(8>7) true\ntemp=a[i];  i.e. temp=a[1]  i.e. temp=8\na[i]=a[j];  i.e. a[1]=a[3] i.e. a[1]=7\na[j]=temp; i.e. a[3]=8<\/code><\/pre>\n
So now are array is a={3,7,12,8}<\/strong><\/p>\n
3rd iteration for(i=2;i<n;i++) i.e. for(i=2;2<4;i++)   \u2013 Outer for loop\n1st iteration for(j=i+1;j<n;j++)  i.e. for(j=3;3a[j])  i.e. if(a[2]>a[3]) i.e. if(12>8)  true\ntemp=a[i];  i.e. temp=a[2]  i.e. temp=12\na[i]=a[j];  i.e. a[2]=a[3] i.e. a[2]=8\na[j]=temp; i.e. a[3]=12<\/code><\/pre>\n
So now are array is a={3,7,8,12}<\/strong>
\nHence we have sorted the elements in ascending order a={3,7,8,12}.<\/strong><\/p>\n
Algorithm for Sort an Array Elements<\/h2>\n
    \n
  • START<\/li>\n
  • INITIALIZE arr[] ={5, 2, 8, 7, 1 }.<\/li>\n
  • SET temp =0<\/li>\n
  • length= sizeof(arr)\/sizeof(arr[0])<\/li>\n
  • PRINT "Elements of Original Array"<\/li>\n
  • SET i=0. REPEAT STEP 7 and STEP 8 UNTIL i<length<\/li>\n
  • PRINT arr[i]<\/li>\n
  • i=i+1.<\/li>\n
  • SET i=0. REPEAT STEP 10 to STEP UNTIL i<n<\/li>\n
  • SET j=i+1. REPEAT STEP 11 UNTIL jarr[j]) then
    \ntemp = arr[i]
    \narr[i]=arr[j]
    \narr[j]=temp<\/li>\n
  • j=j+1.<\/li>\n
  • i=i+1.<\/li>\n
  • PRINT new line<\/li>\n
  • PRINT "Elements of the array sorted in ascending order"<\/li>\n
  • SET i=0. REPEAT the below steps UNTIL i < length<\/li>\n
  • PRINT arr[i]<\/li>\n
  • i=i+1.<\/li>\n
  • RETURN 0.<\/li>\n
  • END.<\/li>\n<\/ul>\n
    C Program for Array Sorting<\/h2>\n\t\t\t\t\t\t