#include<stdio.h>
#include<conio.h>
void main()
{
long int i,j,tmp,a[10];
for(i=0;i<n;i++)
printf("enter nos.\n");
for(i=0;i<10;i++)
scanf("%ld",&a[i]);
for(i=0;i<10;i++)
{
for(j=0;j<9;j++)
if(a[j]>a[j+1])
{
tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
}
printf("sorted array is -->\n");
for( i=0;i<10;i++)
printf("%ld\n",a[i]);
getch();
}
SIMPLE PROGRAMS
- FIND TYPE OF THE TRIANGLE
- TEMPERATURE CONVERSION
- COMMISSION OF A SALESMAN
- PRINT NUMBERS IN DESCENDING ORDER
- BIGGEST NUMBER AMONG THREE NUMBERS
- CALCULATE DIVISION
- A YEAR IS LEAP OR NOT
- A NUMBER IS ODD OR EVEN PRINT THE SQUARE ROOT ELSE PRINT N TO THE POWER 5
- PRINT A NEW NUMBER BY ADDING 1 TO EACH DIGIT OF THE NUMBER
DATA STRUCTURES
IMPORTANT EXAMPLES
FUNCTIONS
- BINARY SEARCH USING RECURSION
- PROGRAM TO ENTER THREE NUMBERS AND PRINT THEIR SUM
- PROGRAM TO ENTER RADIUS OF A CIRCLE, FIND CIRCUMFERENCE AND AREA WITH THE SPECIFIED AREA USE RETURN IN THE FUNCTION
- PROGRAM TO FIND FACTORIAL OF A NUMBER AND USE RETURN STATEMENT IN FUNCTION
- A RECURSIVE FUNCTION TO OBTAIN FIRST N( INPUTTED BY THE USER) NUMBERS OF A FIBONACCI SERIES
- PRINT A STRING BY REMOVING THE VOWELS IN THE STRING
- SWAPPING TWO NUMBERS USING CALL BY REFERENCE
- REVERSE A NUMBER
- FACTORIAL USING RECURSION
- PRINT TABLE OF A NUMBER
- RETURN M TO THE POWER N USING RECURSION
- CHANGING ARRAY USING CALL BY REFERENCE AND CALL BY VALUE
PATTERNS
NUMBERS
- PRIME-PALLINDROME NUMBERS
- DECIMAL TO BINARY
- REVERSE A NUMBER
- BINARY TO DECIMAL
- FACTORIAL OF A NUMBER OR A NUMBER IS PRIME OR NOT
- MULTIPLY TWO NUMBERS WITHOUT USING *
- ARMSTRONG NUMBERS
- PRODUCT OF DIGITS OF THE NUMBER ENTERED
- SUM OF FIRST &LAST DIGITS OF THE NUMBER ENTERED
- PALLINDROME NUMBER
- FACTORIAL OF A NUMBER
- DECIMAL TO OCTAL
STRINGS AND CHARACTERS
- PATTERN IN STRINGS
- CHARACTER INPUTTED IS VOWEL OR CONSONANT
- REVERSING A STRING
- PRINT A STRING BY REMOVING THE VOWELS IN THE STRING
Comments