C Programmer

Previously we learned to insert elements into empty arrays in the order. But how can we insert a particular element into a desired position of an array? For that we need to initialize a variable 'key' which we may use to indicate the position of PC in program. Let's have a look into the program. //Program #include <stdio.h> void main() { int array[10]; int i, j, n, m, temp, key, pos; printf( "Enter how many elements \n "); scanf( "%d" , &n); printf( "Enter the elements \n "); for (i = 0; i < n; i++) { scanf( "%d" , &array[i]); } printf( "Input array elements are \n "); for (i = 0; i < n; i++) { printf( "%d\n ", array[i]); } for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (array[i] > array[j]) { temp = array[i]; array[i] = array[j]; array[j] = temp; } } } printf( "Sorted list is \n "); for (i = 0; i ...

This program makes the concept of array more clear. As arrays are continuous memory locations, we can access them easily by incrementing the number (variable) in square bracket. This method is used in this program. Here using loop each and every element is comparing it with the other elements. //program #include <stdio .h>   int main ( ) { int array [ 50 ] , size , i , largest ; printf ( " \n Enter the size of the array: " ) ; scanf ( "%d" , & size ) ; printf ( " \n Enter %d elements of the array: " , size ) ; for ( i = 0 ; i < size ; i ++ ) scanf ( "%d" , & array [ i ] ) ; largest = array [ 0 ] ; for ( i = 1 ; i < size ; i ++ ) { if ( largest < array [ i ] ) largest = array [ i ] ; } printf ( " \n largest element present in the given array is : %d" , largest ) ; return 0 ; }

It is as simple as the previous program in which we calculated the sum of array elements. //Program #include <stdio.h> void main() {     int n, i;        float num[100], sum = 0.0, average;     printf("Enter the numbers of elements: ");     scanf("%d", &n);     while (n > 100 || n <= 0)     {         printf("Error! number should in range of (1 to 100).\n");         printf("Enter the number again: ");         scanf("%d", &n);     }     for(i = 0; i < n; ++i)     {         printf("%d. Enter number: ", i+1);         scanf("%f", &num[i]);         sum += num[i];     } ...

Array is a mile stone of C Program which we may use almost everywhere. Here is a basic program to understand array, memory locations and structure of array etc. What is an array? An array is a group of continuous memory locations which we can access by the address. An array of a particular datatype can only store values of that data type(often it convert and use the given data). Array initialization The syntax of array initialization in C is : datatype array_name[size]; Algorithm Here the array named 'array' of type 'int' is used to store different numbers and adding them by separately accessing the array elements using for loop. //Program //Program #include <stdio.h< voide main() {     int n, i;        float num[100], sum = 0.0, average;     printf("Enter the numbers of elements: ");     scanf("%d", &n);     while (n > 100 || n <= 0)     { ...

What is an Armstrong number? An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. This definition depends on the base b of the number system used, e.g., b  = 10 for the decimal system or b  = 2 for the binary system. (Read more about Armstrong number) For generating Armstrong number series we use the following algorithm. Algorithm A positive integer is called an Armstrong number of order n if abcd... = a n + b n + c n + d n + ...   In case of 3 digit Armstrong numbers the sum of cubes of the digits of the number will be equal to the actual number. Thus we can use a conditional statement to split a number, multiply, add and check with original number.   #include < stdio .h > #include < math .h > int main() { int low, high, i, temp1, temp2, remainder, n = 0, result = 0; printf("Enter two numbers(intervals): "); scanf("%d %d", &low, &high); pri...

This is a simple program. Here the technique used is to generate prime numbers from one lower limit to one upper limit using loop. For more details refer our previous program : C Program to Check Whether a Number is Prime or Not. //Program #include < stdio.h > int main() {     int low, high, i, flag;     printf("Enter two numbers(intervals): ");     scanf("%d %d", &low, &high);     printf("Prime numbers between %d and %d are: ", low, high);     while (low < high)     {         flag = 0;         for(i = 2; i <= low/2; ++i)         {             if(low % i == 0)             {             ...

What is an Armstrong number? An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. This definition depends on the base b of the number system used, e.g., b  = 10 for the decimal system or b  = 2 for the binary system. (Read more about Armstrong number) For generating Armstrong number series we use the following algorithm. Algorithm A positive integer is called an Armstrong number of order n if abcd... = a n + b n + c n + d n + ...   In case of 3 digit Armstrong numbers the sum of cubes of the digits of the number will be equal to the actual number. Thus we can use a conditional statement to split a number, multiply, add and check with original number.   #include < stdio .h > #include < math .h > int main() { int low, high, i, temp1, temp2, remainder, n = 0, result = 0; printf("Enter two numbers(intervals): "); scanf("%d %d", &low, &high); pri...

In this program we use if else if ladder mechanism. If an integer is equal to the reverse of it, then it is a palindrome.  Algorithm   In this program we divide the given number by 10 and take the reminder(This could be done by using % operator).  Arrange the reminders in order to get the reverse of original number. Check whether original number is equal to  the reverse of it.   //Program   #include int main () { int n , reversedInteger = 0 , remainder , originalInteger ; printf ( "Enter an integer: " ); scanf ( "%d" , & n ); originalInteger = n ; // reversed integer is stored in variable while ( n != 0 ) { remainder = n % 10 ; reversedInteger = reversedInteger * 10 + remainder ; n /= 10 ; } // palindrome if orignalInteger and reversedInteger are equal if ( originalInteger == reversedInteger ) printf ( "%d is a palindrome." , ...

It is easy to find the power of any number in calculator. For doing the same in a C program needs  an algorithm.    Algorithm   Identify the base number -> Identify the exponent -> find power. This can be illustrated with an example of 2 3 .  Here Base is '2'; exponent is '3' and the power is 2*2*2 = 8.   #include int main () { int base , exponent ; long result = 1 ; printf ( "Enter a base number: " ); scanf ( "%d" , & base ); printf ( "Enter an exponent: " ); scanf ( "%d" , & exponent ); while ( exponent != 0 ) { result *= base ; -- exponent ; } printf ( "Answer = %ld" , result ); return 0 ; }

/* To display Average of a set of given numbers. */ 1. Read the value of n. 2. i = 1 , SUM = 0. 3. if  i > n go to 9 4. Read the value of x. 5. SUM = SUM + x 6. i = i + 1 7. go to 3 8. AVERAGE = SUM / n 9. Display AVERAGE. 10. Stop * x is user defined numbers. /* To display Largest of a set of given positive numbers. */  1. Read the value of n. 2. i = 0 , Y= 0 3. if i <= n go to 7 4. Read the value of X 5. If X > Y then Y = X 6. go to 3 7. Display Y 8. Stop /* To display Latgest of a set of given numbers. */   1. Read the value of n. 2. i = 0 3. if i <= n go to 7 4. Read the first number in X 5. S = X 6. i = i + 1 7. If  i > n go to 8. Read the Second number in X 9. If X > S then S = X 10. go to 4 11. Display S 12. Stop /* To display Smallest of a set of given numbers. */   1. Read the value of n. 2. i = 0 3. if i <= n go to 7 4. Read the first number in X 5. S = X 6. i = i + 1 7. ...

/* Sum of n natural numbers */ 1. Read the value of n. 2. i = 1 , SUM = 0 3. if ( i > n ) go to 7 4. S = S + i 5. i = i + 1 6. go to 3 7. Display the value of S 8. Stop /* Factorial of n numbers */ 1. Read the value of n. 2. i = 1 , F =1 3. if ( i > n ) go to 7 4. F = F * i 5. i = i + 1 6. go to 3 7. Display the value of S 8. Stop /* To Find the value of  x n */ 1. Read the value of n. 2. i = 1 , m = 1 3. If i > n then go to 7 4. m = m * x 5. i = i + 1 6. go to 3 7. Display m 8. Stop

/* Algorithm For print "n" numbers */ 1. Read the value of n. 2. i = 1 3. if ( i > n ) go to step 7 4. Display value of i 5. i = i + 1 6. go to step 3 7. Stop /* Algorithm For print "n even" numbers */ 1. Read the value of n. 2. i = 2 3. if ( i > n ) go to step 7 4. Display value of i 5. i = i +2 6. go to step 3 7. Stop /* Algorithm For print "n odd" numbers */ 1. Read the value of n. 2. i = 1 3. if ( i > n ) go to step 7 4. Display value of  i 5. i = (2n - 1) 6. go to step 3 7. Stop

1. Read the value of a , b , c 2. d = b*b - 4*a*c 3. if d < 0 then display The Roots are Imaginary.            else if d = 0                      then dispaly Roots are Equal.                                        r = -b / 2*a                                        display r                  else r1 = -b + √d / 2*a           ...

/* To display the largest one from given two numbers. */ 1. Read the value of a and b. 2. if a>b then display a        else display b /* To display the smallest one from given two numbers. */  1. Read the value of a and b. 2. if a<b then display a        else display b

It's an algorithm for to find sum of two user defined numbers. *Not a program. To add two numbers. Read the Value of A and B. SUM = A+B. Display SUM. Stop. Similarly to Multiply two numbers. Read the Value of A and B. PRODUCT = A*B. Display PRODUCT. Stop. For Divide two numbers. Read the Value of A and B. DIV = A/B. Display DIV. Stop. For Subtract two Numbers. Read the Value of A and B. SUB = A-B. Display SUB. Stop. * You can change SUM, PRODUCT, DIV amd SUB with your variables and note that you must to change the 3. Dispaly SUM / PRODUCT /DIV/ SUB.