Write a c program to arrange the digits of a number in ascending order?

Answer 1

#include

#include

void main()

{

int n ,i,j,temp,a[12]; //in a[] specify some number .

printf("Enter the no of inputs:");

scanf("%d", &n);

printf("Enter %d integer numbers :", n);

for(i=0;i

{

scanf("%d",&a[i]);

}

for (i=0;i

for(j=i+1;j

{

if(a[i]>a[j])

{

temp=a[j];

a[j]=a[i];

a[i]=temp;

}

}

printf("THE %d NUMBERS SORTED IN ASCENDING ORDER ARE :\n", n);

for(i=0;i

{

printf("%d ",a[i]);

}

getch();

}

Here is another version of the program. While the previous one is obviously simpler, this one is a good program to master the basics of pointer and array problems which might plague them at the beginning.

#include

#include

int a[100],i,j,k,n;

void sort(int *a,int n);

void swap(int *x,int *y);

main()

{

printf("How many numbers? ");

scanf("%d",&n);

printf("Enter the %d numbers separated from each other by a blank space: \n\n",n);

for (i=0;i

scanf("%d",&a[i]);

sort(a,n);

printf("\nThe numbers in descending order is: \n");

for (k=0;k

printf("\n%d",a[k]);

printf("\n\n");

}

void sort(int *a,int n)

{

int p=n-1;

while (p>=0)

{

for(i=0;i<=(p-1);++i)

{

if (a[i]<=a[i+1])

swap(&a[i],&a[i+1]);

else

continue;

}

--p;

}

}

void swap(int *x,int *y)

{

int t;

t=*x;

*x=*y;

*y=t;

}

Answer 2

#include<iostream>

#include<algorithm>

void arrange (int* arr, const size_t size) {

std::sort (arr, arr+size);

}

int main () {

int a[8] {7, 19, 13, 2, 17, 5, 3, 11};

arrange (a, 8);

for (auto a : x) std::cout << x << ' ';

std::cout << std::endl;

}

Answer 3

template<class T>

void selection_sort (T a[], size_t size)

{

if (size<2)

return;

for (size_t left=0; left<size-1; ++left)

{

size_t selected=left;

for (size_t right=left+1; right<size; ++right)

if (a[right]<a[selected])

selected=right;

if (left!=selected)

{

T t = a[left];

a[left] = a[selected];

a[selected] = t;

}

}

}

Answer 4

// simple bubble sort - ellipses (...) used to indicate indentation for clarity

// an array - size 20 - could be anything

int a[20] = {1, 7, 5, 3, 7, 9, 67, 4, 20, 45, 76, 23, -1, -5, -8, 12, 67, 45, 23, 34 };

int swapflag = 1;

int i;

while (swapflag == 1) {

... swapflag = 0;

... for (i=0; i<19; i++)

... ... if (a[i] < a[i+1]) {

... ... ... swapflag = 1;

... ... ... a[i] ^= a[i+1];

... ... ... a[i+1] ^= a[i];

... ... ... a[i] ^= a[i];

... ... }

... }

}

Answer 5

Computer programmers use an array to arrange digits of a number in ascending order. The program uses character array to store the digits and a quick sort feature to sort them.

Answer 6

Put the numbers in a vector and sort the vector. Then print it.