<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://ideawaza.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=203.115.84.0%2F24</id>
	<title>IdeaWazaWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://ideawaza.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=203.115.84.0%2F24"/>
	<link rel="alternate" type="text/html" href="https://ideawaza.com/wiki/Special:Contributions/203.115.84.0/24"/>
	<updated>2026-09-30T14:17:42Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.46.0</generator>
	<entry>
		<id>https://ideawaza.com/index.php?title=An_array_in_ascending_order_in_C&amp;diff=52281</id>
		<title>An array in ascending order in C</title>
		<link rel="alternate" type="text/html" href="https://ideawaza.com/index.php?title=An_array_in_ascending_order_in_C&amp;diff=52281"/>
		<updated>2006-12-19T07:02:21Z</updated>

		<summary type="html">&lt;p&gt;203.115.84.150: New page: &amp;lt;pre&amp;gt;/* TO PRINT THE NUMBERS IN ASCENDING AND DESCENDING ORDER USING ARRAYS */
/* PERFORMED BY MILAN */

#include &amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;

void main()
{
	int a[10], i=0, j=0, n, t;
	cl...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;pre&amp;gt;/* TO PRINT THE NUMBERS IN ASCENDING AND DESCENDING ORDER USING ARRAYS */&lt;br /&gt;
/* PERFORMED BY MILAN */&lt;br /&gt;
&lt;br /&gt;
#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;
#include&amp;lt;conio.h&amp;gt;&lt;br /&gt;
&lt;br /&gt;
void main()&lt;br /&gt;
{&lt;br /&gt;
	int a[10], i=0, j=0, n, t;&lt;br /&gt;
	clrscr();&lt;br /&gt;
&lt;br /&gt;
	printf (&amp;quot;\n Enter the no. of elements: &amp;quot;);&lt;br /&gt;
	scanf (&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
	printf (&amp;quot;\n&amp;quot;);&lt;br /&gt;
&lt;br /&gt;
	for (i = 0; i &amp;lt;n; i++)&lt;br /&gt;
	{&lt;br /&gt;
	printf (&amp;quot;\n Enter the %dth element: &amp;quot;, (i+1));&lt;br /&gt;
	scanf (&amp;quot;%d&amp;quot;, &amp;amp;a[i]);&lt;br /&gt;
	}&lt;br /&gt;
&lt;br /&gt;
	for (j=0 ; j&amp;lt;(n-1) ; j++)&lt;br /&gt;
	{&lt;br /&gt;
		for (i=0 ; i&amp;lt;(n-1) ; i++)&lt;br /&gt;
		{&lt;br /&gt;
		if (a[i+1] &amp;lt; a[i])&lt;br /&gt;
		{&lt;br /&gt;
		t = a[i];&lt;br /&gt;
		a[i] = a[i + 1];&lt;br /&gt;
		a[i + 1] = t;&lt;br /&gt;
		}&lt;br /&gt;
		}&lt;br /&gt;
	}&lt;br /&gt;
&lt;br /&gt;
	printf (&amp;quot;\n Ascending order: &amp;quot;);&lt;br /&gt;
	for (i=0 ; i&amp;lt;n ; i++)&lt;br /&gt;
	{&lt;br /&gt;
		printf (&amp;quot; %d&amp;quot;, a[i]);&lt;br /&gt;
	}&lt;br /&gt;
&lt;br /&gt;
	printf (&amp;quot;\n Descending order: &amp;quot;);&lt;br /&gt;
	for (i=n ; i&amp;gt;0 ; i--)&lt;br /&gt;
	{&lt;br /&gt;
		printf (&amp;quot; %d&amp;quot;, a[i-1]);&lt;br /&gt;
	}&lt;br /&gt;
	getch();&lt;br /&gt;
}&lt;br /&gt;
/* OUTPUT:&lt;br /&gt;
&lt;br /&gt;
 Enter the no. of elements: 5&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 Enter the 1th element: 25&lt;br /&gt;
&lt;br /&gt;
 Enter the 2th element: 50&lt;br /&gt;
&lt;br /&gt;
 Enter the 3th element: 75&lt;br /&gt;
&lt;br /&gt;
 Enter the 4th element: 35&lt;br /&gt;
&lt;br /&gt;
 Enter the 5th element: 100&lt;br /&gt;
&lt;br /&gt;
 Ascending order:  25 35 50 75 100&lt;br /&gt;
 Descending order:  100 75 50 35 25&lt;br /&gt;
 */&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>203.115.84.150</name></author>
	</entry>
</feed>