The ones who are crazy enough to think they can change the world are the ones who do.- Steve Jobs
Mathematically, when certain sets of numbers are arranged from largest number to the smallest number then they are said to be descending order
Sounding as a programmer, descending order can only be performed in array data type, because array is the only place where you can store certain sets of data in a consecutive memory location for future use.
Let us code descending order in C program and have some fun
#include <stdio.h> int main() { int i, j, n, a[30], temp = 0; printf("\nEnter a number : "); scanf("%d", &n); printf("\nEnter %d numbers to sort "); for(i = 0;i < n;i++) scanf("%d", &a[i]); for(i = 0;i < n-1;i++) { for(j = i;j < n;j++) { if(a[i] < a[j]) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } } printf("\n----Descending Order---- "); for(i = 0;i < n;i++) printf("%d ", a[i]); return 0; }
Enter a number : 5 Enter Numbers to sort : 27 24 29 22 26 ----Descending Order---- 29 27 26 24 22
First of all, we ask our user to enter a limit, then we use an array to get the user entered input. Now we have an array of all user entered number. Now it's time to arrange all user entered input in an descending order. For that we use 2 things.
First for loop is used to hold the first value in a[] array whereas second for loop is used to scan the numbers in a[] from 1st element to last element. If the number in a[i] is lesser than a[j] then swapping is done by using our temperary variable temp. This kind of swapping of two numbers in an array is said to be bubble sort algorithm.
We may make mistakes(spelling, program bug, typing mistake and etc.), So we have this container to collect mistakes. We highly respect your findings.
© Copyright 2019