Write a C program to add a series of odd numbers i.e. 1+3+5+7+……..+n

This program will give you an idea of adding a series having only odd numbers. Let a series  1+3+5+7+……..25. Now Define the first odd number by a variable and last odd number by another variable. Then use a while loop for performing sum operation. Here I used variable i as loop counter as well as putting each odd number of the series on it. While loop will stop when i>lastODDnumber 

#include <stdio.h> 
    int i,n1,n2,SUM=0;
    printf("Insert the first ODD number: ");
    printf("Insert the last ODD number: ");
    i=n1; //initialize i by first odd number
    printf("Total: %d",SUM);
    return 0;

Write a C program to calculate a series of integer numbers as 1+2+3+......+n

Here 1+2+3+…….+n is a simple series where each number can be added using a single loop. At first take a variable SUM and initialize it by Zero. Then add each number of the series successively. Then print the SUM.


#include <stdio.h>

  int i,n,SUM=0;
  printf("Insert the last number: ");
  printf("Total: %d",SUM);

  return 0;

Algorithm of Insertion sort and a program of insertion sort in C

Insertion sort:

It is simple to sort a set of integer number or character set using insertion algorithm. Let you have unsorted array A[] of 10 elements.
A[]={23, 17, 12, 25, 33, 14, 17, 26, 21, 19}
I am showing you first six elements sorting in below.
  • 23, 17, 12, 25, 33, 14, 17, 26, 21, 19  [initially]
  • 17, 23,12, 25, 33, 14, 17, 26, 21, 19  [key= A[1] or 17 according to previous line that was sorted in this line]
  • 12, 17, 23, 25, 33, 14, 17, 26, 21, 19   [key= A[2] or 12 according to previous line]
  • 12, 17, 23, 2533, 14, 17, 26, 21, 19   [key= A[3] or 25 according to previous line, but here after first comparison of 12 with previous element we see no need to sort ]
  • 12, 17, 23, 25, 33, 14, 17, 26, 21, 19   [key=A[4] or 33 according to previous line, but here after first comparison of  with previous element we see no need to sort ]
  • 12, 14, 17, 23, 25, 33, 17, 26, 21, 19 and that’s way all elements are sorted.
You have seen that every time key is placed in proper location in the array. We have seen that before all elements of a key have already been sorted

A program for function: Search, Insert, Show, Push, Pop || Array and Stack using Function call

Use this program to run certain function with array and stack. Function: search, insert, show, push and pop. Use a menu to make choice for run operation. I give you a code based on my algorithm. Try to find another algorithm and then make code. Before start learn about Array and Stack and difference between them.

#define max 20
int ARRAY();
int STACK();
int SEARCH(int LA[max], int N);
int INSERT(int LA[max], int N);
int SHOW(int LA[max], int N);
int PUSH(int stk[max], int TOP);
int POP(int stk[max], int TOP);

int main()
        char ch;
            printf("\nMake a choice of your operation:")  ;
            printf("\nA: for ARRAY operation");
            printf("\nS: for STACK operation");
            printf("\nX: for EXIT\n");