Category Archives: C Programs

C Programs

C Print Series upto n Term

C Program to Print Series upto n Term.

In this tutorial, we will learn to create a C program that will Print Series up to n Term in C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in c programming.

Print Series up to n Term.

As we all know the c programming is a very powerful language. In the c programming language, we have many pre-defined functions for arithmetic operations. But today we will print the series up to the given number using the c programming language.

With C programming we can make many arithmetics series with just a little code.

With the help of this program, we can Print Series up to n Term.

Algorithm:-

1. Declare the variables for the program.
 
2. Take the input number from the user.
 
3. Pass that number to a while loop.
 
4. Calculate the size of number.
 
5. Print the size of that number.
 
6. End the program.

1. Declare the variables for the program.

2. Take the input number from the user.

3. Pass that number to a while loop.

4. Calculate the size of number.

5. Print the size of that number.

6. End the program.

Program to Print Series up to n Term:-

#include<stdio.h>

int main()
{
    //declaring the variable for the program
    int No, i;
    
    //taking input number from the user for the series
    printf("Enter the value of No (limit) for the series : ");
    scanf("%d", &No);
    
    printf("\n");
    //printing the series upto the given number with the 
    //help of for loop
    
    for(i=1; i<=No; i++)
    {
        if(i==No)
          //printing numbers
            printf("%d", i);
        else
         //printing numbers
            printf("%d,", i);
    }
 
    return 0;
}

#include<stdio.h>

int main()

{

//declaring the variable for the program

int No, i;

//taking input number from the user for the series

printf("Enter the value of No (limit) for the series : ");

scanf("%d", &No);

printf("\n");

//printing the series upto the given number with the

//help of for loop

for(i=1; i<=No; i++)

{

if(i==No)

//printing numbers

printf("%d", i);

else

//printing numbers

printf("%d,", i);

}

return 0;

}

Output:-

In the above program, we have first initialized the required variable.

i = it will hold the integer value for the loop.
No = it will hold the integer value of number input.

Display message to Take input number from the user and scan the input number.

Program code to print the list up to the given number.

C Program to Check Leap Year or Not

C Program to Check Leap Year or Not.

In this tutorial, we will learn to create a C program that will Check Leap Year or Not in C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
String functions in c programming.

Check Leap Year or Not.

As we all know the c programming is a very powerful language. In the c programming language, we have many pre-defined functions for arithmetic operations. but today we will check whether the given number is a leap year or not with the help of the c programming language.

With the help of this program, we can Check Leap Year or Not.

Algorithm:-

1. Declare the variables for the program. 

2. Take the input number from the user.

3. Pass that number to a condition.

4. Calculate the leap year from the given number.

5. Print the output string after checking.

6. End the program.

1. Declare the variables for the program.

2. Take the input number from the user.

3. Pass that number to a condition.

4. Calculate the leap year from the given number.

5. Print the output string after checking.

6. End the program.

Program to Check Leap Year or Not:-

#include <stdio.h>
int main()
{
    //declaring the variable for the program
   int yr;
   //taking input year
   printf("Enter the year to check: ");
   scanf("%d", &yr);

   // leap year if perfectly divisible by 400
   if (year % 400 == 0) {
      printf("%d is a leap year.", yr);
   }
   // not a leap year if divisible by 100
   // but not divisible by 400
   else if (yr % 100 == 0) {
      printf("%d is not a leap year.", yr);
   }
   // leap year if not divisible by 100
   // but divisible by 4
   else if (yr % 4 == 0) {
      //printing output
      printf("%d is a leap year.", yr);
   }
   // all other years are not leap years
   else {
      //printing output 
      printf("%d is not a leap year.", yr);
   }

   return 0;
}

#include <stdio.h>

int main()

{

//declaring the variable for the program

int yr;

//taking input year

printf("Enter the year to check: ");

scanf("%d", &yr);

// leap year if perfectly divisible by 400

if (year % 400 == 0) {

printf("%d is a leap year.", yr);

}

// not a leap year if divisible by 100

// but not divisible by 400

else if (yr % 100 == 0) {

printf("%d is not a leap year.", yr);

}

// leap year if not divisible by 100

// but divisible by 4

else if (yr % 4 == 0) {

//printing output

printf("%d is a leap year.", yr);

}

// all other years are not leap years

else {

//printing output

printf("%d is not a leap year.", yr);

}

return 0;

}

Output:-

In the above program, we have first initialized the required variable.

yr = it will hold the integer value of number input.

Taking input number from the user.

Calculating and Printing output of the program.

C Program to Sort Word in String in Ascending Order

C Program to sort Word in String in Ascending Order

In this tutorial, we will learn to create a C program that will sort Word in String in Ascending Order in C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in c programming.
String functions of c programming.

Sort Word in String in Ascending Order

As we all know the String is a collection of character data types. In strings, only one variable is declared which can store multiple values. First, we will take the input string from the user.

Then we will sort that string using the for a loop.

With the help of this program, we can sort Word in String in Ascending Order.

Algorithm:-

1. Declare the variables for the program. 

2. Take the input string from the user. 

3. Pass that string to a for loop. 

4. Sorting the string in ascending order. 

5. Print the string. 

6. End the program.

1. Declare the variables for the program.

2. Take the input string from the user.

3. Pass that string to a for loop.

4. Sorting the string in ascending order.

5. Print the string.

6. End the program.

Program to Sort Word in String in Ascending Order:-

#include<stdio.h>
#include<string.h>
int main()
{
    //declaring the variables for the program
    char str[100], flag;
    int i, j, len;
    
    //taking the input from the user
    printf("Enter any string: ");
    
    // reading the input
    gets(str);
    
    //calcuting the size of string
    len = strlen(str);
    
    //sorting a string
    for(i=0; i<len; i++)
    {
        for(j=0; j<(len-1); j++)
        {
            if(str[j]>=65 && str[j]<=90)
            {
                if(str[j+1]>=65 && str[j+1]<=90)
                {
                    if(str[j]>str[j+1])
                    {
                        flag = str[j];
                        str[j] = str[j+1];
                        str[j+1] = flag;
                    }
                }
            }
            if(str[j]>=97 && str[j]<=122)
            {
                if(str[j+1]>=97 && str[j+1]<=122)
                {
                    if(str[j]>str[j+1])
                    {
                        flag = str[j];
                        str[j] = str[j+1];
                        str[j+1] = flag;
                    }
                }
            }
        }
    }
    
    //printing the output string
    printf("\nSame string with each word in Ascending Order:\n%s", str);
   
    return 0;
}

#include<stdio.h>

#include<string.h>

int main()

{

//declaring the variables for the program

char str[100], flag;

int i, j, len;

//taking the input from the user

printf("Enter any string: ");

// reading the input

gets(str);

//calcuting the size of string

len = strlen(str);

//sorting a string

for(i=0; i<len; i++)

{

for(j=0; j<(len-1); j++)

{

if(str[j]>=65 && str[j]<=90)

{

if(str[j+1]>=65 && str[j+1]<=90)

{

if(str[j]>str[j+1])

{

flag = str[j];

str[j] = str[j+1];

str[j+1] = flag;

}

if(str[j]>=97 && str[j]<=122)

{

if(str[j+1]>=97 && str[j+1]<=122)

{

if(str[j]>str[j+1])

{

flag = str[j];

str[j] = str[j+1];

str[j+1] = flag;

}

//printing the output string

printf("\nSame string with each word in Ascending Order:\n%s", str);

return 0;

}

Output:-

In the above program, we have first initialized the required variable.

str[100] = it will hold the string value.
len = it will hold the integer value.
i = it will hold the integer value.
j = it will hold the integer value.
flag = it will hold the string value.

Input strings from the user.

Scanning string from the user.

Getting the length of the string.

Sorting the string using for loop.

Printing the output.

C Program to find number is even or odd

In this tutorial, we will learn to create a program to find whether a given number is even or odd using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

C Operators
C if else statement

How to find number is even or odd

An integer number that is exactly divisible by 2 is known as even number, example: 0, 8, -24. Programmatically, we can check number is even or add using modulus (%) operator. If modulus 2 of any integer number is equals to 0 then, the number is even otherwise odd.

Program to find number is even or odd

In this program we will find a number entered by user is even or odd using modulus (%) operator. We would first declared and initialized the required variables. Next, we would prompt user to input an integer number. Later in the program we will check number entered by user is even or odd using modulus (%) operator. We will then display message number is even or odd.

#include <stdio.h>
int main() {
    int num;
    printf("Enter an integer: ");
    scanf("%d", &num);

    if(num % 2 == 0)
        printf("%d is even number.", num);
    else
        printf("%d is odd number.", num);
    
    return 0;
}

#include <stdio.h>

int main() {

int num;

printf("Enter an integer: ");

scanf("%d", &num);

if(num % 2 == 0)

printf("%d is even number.", num);

else

printf("%d is odd number.", num);

return 0;

}

Output 1:-

C-Program-to-check-number-is-even-or-odd-11

Output 2:-

C-Program-to-check-number-is-even-or-odd-2

In the above program, we have first declared and initialized a set variables required in the program.

num = it holds the input integer number

In the next statement user will be prompted to enter an integer number to check is assigned to variable ‘num’. In the next statement we check modulus 2 of integer number is equals to 0 or not i.e. if(num % 2 == 0) then the number is even otherwise odd. Now, we will be displaying the number is even or odd.

Program to check number is even or odd Using Bitwise operator

In this program we will check a number entered by user is even or odd using bitwise(&) operator. We would first declared and initialized the required variables. Next, we would prompt user to input an integer number. Later in the program we will check number entered by user is even or odd using bitwise(&) operator. We will then display message number is even or odd.

#include<stdio.h>
int main() {
   int num;
 
   printf("Enter an integer: ");
   scanf("%d",&num);
 
   if ( num & 1)
      printf("%d is odd number", num);
   else
      printf("%d is even number", num);
 
   return 0;
}

#include<stdio.h>

int main() {

int num;

printf("Enter an integer: ");

scanf("%d",&num);

if ( num & 1)

printf("%d is odd number", num);

else

printf("%d is even number", num);

return 0;

}

Output 1:-

C-Program-to-check-number-is-even-or-odd-11

Output 2:-

C-Program-to-check-number-is-even-or-odd-2

In the above program, we have first declared and initialized a set variables required in the program.

num = it holds the input integer number

In the next statement user will be prompted to enter an integer number to check is assigned to variable ‘num’. In the next statement we check number is even or odd using bitwis(&) operator i.e. if(num & 1 == 1) then the number is odd otherwise even. Now, we will be displaying the number is even or odd.

C Program to implement Shell sort Algorithm

In this tutorial, we will learn to create a C program that will do Shell sort using C programming.

Prerequisites

Before starting this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Shell Sort?

In every programming language, the sorting of data is a very important factor. Sorting works are done mainly with the techniques available in C Language. Many different techniques for sorting are available to work with but in this tutorial, we will focus on the Shell Sort Technique.

The Shell Sort is an evolved version of the insertion sort. Well will pick the data from an index point of array is and swap it with a faraway position index. Then data interchange between 2 locations from the array and doesn’t need to be too close to be swapped.

Program For Shell Sort

#include <stdio.h>
/* function for Shell Sort */
int shell(int x[], int no)
{
/* The array elements are rearranged at n/2, n/4, ..., first pass */
for (int in= no/2; in > 0; in /= 2)
{
for (int i = in; i < no; i += 1)
{
/* store values of x[i] to the variable flag and making the ith position empty */
int flag = x[i];
int j;
for (j = i; j >= in && x[j - in] > flag; j -= in)
x[j] = x[j - in];

// put flag (it means the x[i]) in its correct position
x[j] = flag;
}
}
return 0;
}
void printArray(int x[], int no) 
/* Printing elements of array  sorted*/
{
int i;
for (i = 0; i < no; i++)
printf("%d ", x[i]);
}
int main()
{
int x[] = { 11, 22, 34, 54, 55 };
int no = sizeof(x) / sizeof(x[0]);
printf("Before sorting elements of array  are - \n");
printArray(x, no);
shell(x, no);
printf("\nAfter applying shell sort, the elements of array are - \n");
printArray(x, no);
return 0;
}

#include <stdio.h>

/* function for Shell Sort */

int shell(int x[], int no)

{

/* The array elements are rearranged at n/2, n/4, ..., first pass */

for (int in= no/2; in > 0; in /= 2)

{

for (int i = in; i < no; i += 1)

{

/* store values of x[i] to the variable flag and making the ith position empty */

int flag = x[i];

int j;

for (j = i; j >= in && x[j - in] > flag; j -= in)

x[j] = x[j - in];

// put flag (it means the x[i]) in its correct position

x[j] = flag;

}

return 0;

}

void printArray(int x[], int no)

/* Printing elements of array sorted*/

{

int i;

for (i = 0; i < no; i++)

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

}

int main()

{

int x[] = { 11, 22, 34, 54, 55 };

int no = sizeof(x) / sizeof(x[0]);

printf("Before sorting elements of array are - \n");

printArray(x, no);

shell(x, no);

printf("\nAfter applying shell sort, the elements of array are - \n");

printArray(x, no);

return 0;

}

Output:-

In the above program, we have first declared and initialized a set of variables required in the program.

no = it will hold the size of an array.
x[]= it will hold the elements in an array.
i= it will hold the integer value to the control array.
j= it will hold the integer value to the control array.

After this, we make the main function for our program and define variables calling functions.

The Shell Sorting function body

The printing array function body

C Program to implement Radix sort Algorithm

In this tutorial, we will learn to create a C program that will do Radix sort using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Radix sort?

The Radix Sort is a simple and easy technique. It first makes the group of similar values from a big given array then those small groups are again re-arranged and placed at the deserving positions.

Program for Radix sort

#include <stdio.h>  
  
int getMaximum(int arr[], int no) {  
   int max = arr[0];  
   for(int i = 1; i<no; i++) {  
      if(arr[i] > max)  
         max = arr[i];  
   }  
   return max; //Getting maximum element from the array  
}  
void countingSort(int arr[], int no, int place) 
// function for implement counting sort to program  
{  
  int output[no + 1];  
  int count[10] = {0};    
  
  // Calculating count of elements  
  for (int i = 0; i < no; i++)  
    count[(arr[i] / place) % 10]++;  
      
  // Calculating cumulative frequency  
  for (int i = 1; i < 10; i++)  
    count[i] += count[i - 1];  
  
  // Placing the elements of array in sorted order/format  
  for (int i = no - 1; i >= 0; i--) {  
    output[count[(arr[i] / place) % 10] - 1] = arr[i];  
    count[(arr[i] / place) % 10]--;  
  }  
  
  for (int i = 0; i < no; i++)  
    arr[i] = output[i];  
}  
  
// function for implement radix sort  
void radixsort(int arr[], int no) {  
   
  // maximum element from array grabing 
  int max = getMaximum(arr, no);  
  
  // Applying counting sort to sort elements based on place value  
  for (int place = 1; max / place > 0; place *= 10)  
    countingSort(arr, no, place);  
}  
  
// function for printing array elements  
void printArray(int arr[], int no) {  
  for (int i = 0; i < no; ++i) {  
    printf("%d  ", arr[i]);  
  }  
  printf("\n");  
}  
  
int main() {  
  int arr[] = {971, 328, 358, 827, 869, 139, 595};  
  int no = sizeof(arr) / sizeof(arr[0]);  
  printf("Before sorting the elements of array are - \n");  
  printArray(arr,no);  
  radixsort(arr, no);  
  printf("After applying Radix sort,the elements of array are - \n");  
  printArray(arr, no);  
}

#include <stdio.h>

int getMaximum(int arr[], int no) {

int max = arr[0];

for(int i = 1; i<no; i++) {

if(arr[i] > max)

max = arr[i];

}

return max; //Getting maximum element from the array

}

void countingSort(int arr[], int no, int place)

// function for implement counting sort to program

{

int output[no + 1];

int count[10] = {0};

// Calculating count of elements

for (int i = 0; i < no; i++)

count[(arr[i] / place) % 10]++;

// Calculating cumulative frequency

for (int i = 1; i < 10; i++)

count[i] += count[i - 1];

// Placing the elements of array in sorted order/format

for (int i = no - 1; i >= 0; i--) {

output[count[(arr[i] / place) % 10] - 1] = arr[i];

count[(arr[i] / place) % 10]--;

}

for (int i = 0; i < no; i++)

arr[i] = output[i];

}

// function for implement radix sort

void radixsort(int arr[], int no) {

// maximum element from array grabing

int max = getMaximum(arr, no);

// Applying counting sort to sort elements based on place value

for (int place = 1; max / place > 0; place *= 10)

countingSort(arr, no, place);

}

// function for printing array elements

void printArray(int arr[], int no) {

for (int i = 0; i < no; ++i) {

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

}

printf("\n");

}

int main() {

int arr[] = {971, 328, 358, 827, 869, 139, 595};

int no = sizeof(arr) / sizeof(arr[0]);

printf("Before sorting the elements of array are - \n");

printArray(arr,no);

radixsort(arr, no);

printf("After applying Radix sort,the elements of array are - \n");

printArray(arr, no);

}

Output:-

In the above program we have first initialized the required variable and passed them to other functions for the Radix sort

no = it will hold the size of the array.
arr[]= it will hold the elements in an array.
i= it will hold the integer value to control the array.
j= it will hold the integer value to control the array.

Now the program will call the print function to display the elements.

After this, the program executes the next function & finds the largest number from the elements of the array.

Now the function to do count sort first

Now, the final step radix function to process the data.

As a result we got the sorted array.

By calling the print function.

C Program to implement Bubble sort Algorithm

In this tutorial, we will learn to create a C program that will do Bubble sort using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Bubble Sort?

In every programming language, the sorting of data is a very important factor. In C Language. Many different techniques for sorting are available to work with but in this tutorial, we will focus on the Bubble Sort Technique.

In this technique, the elements of the array are sorted from the very first value by swapping from starts first & second and going to till the end. Now, this process will go on until the array is completely arranged.

Algorithm for optimized bubble sort

bubbleSort(array)
n = length(array)
repeat
  swapped = false
  for i = 1 to n - 1
         if array[i - 1] > array[i], then
         swap(array[i - 1], array[i])
         swapped = true
         end if
   end for
   n = n - 1
 until not swapped
end bubbleSort

bubbleSort(array)

n = length(array)

repeat

swapped = false

for i = 1 to n - 1

if array[i - 1] > array[i], then

swap(array[i - 1], array[i])

swapped = true

end if

end for

n = n - 1

until not swapped

end bubbleSort

Program For Bubble Sort

#include<stdio.h>    
 void print(int x[], int no) //function to print elements of array
    {  
    int i;  
    for(i = 0; i < no; i++)    
    {    
        printf("%d ",x[i]);    
    }        
    }  
 void bubble(int x[], int no) // function for implement bubble sort  
 {  
   int i, j, flag;  
   for(i = 0; i < no; i++)    
    {    
      for(j = i+1; j < no; j++)    
        {    
            if(x[j] < x[i])    
            {    
                flag = x[i];    
                x[i] = x[j];    
                x[j] = flag;     
            }     
        }     
    }     
 }  
void main ()    
{    
    int i, j,flag;     
    int x[5] = { 78, 69, 13, 96, 95};     
    int no = sizeof(x)/sizeof(x[0]);   
    printf("Before sorting elements of array - \n");  
    print(x, no);  
    bubble(x, no);  
    printf("\nAfter sorting elements of array- \n");    
    print(x, no);  
}

#include<stdio.h>

void print(int x[], int no) //function to print elements of array

{

int i;

for(i = 0; i < no; i++)

{

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

}

void bubble(int x[], int no) // function for implement bubble sort

{

int i, j, flag;

for(i = 0; i < no; i++)

{

for(j = i+1; j < no; j++)

{

if(x[j] < x[i])

{

flag = x[i];

x[i] = x[j];

x[j] = flag;

}

void main ()

{

int i, j,flag;

int x[5] = { 78, 69, 13, 96, 95};

int no = sizeof(x)/sizeof(x[0]);

printf("Before sorting elements of array - \n");

print(x, no);

bubble(x, no);

printf("\nAfter sorting elements of array- \n");

print(x, no);

}

Output :-

In the above program, we have first declared and initialized a set variables required in the program.

no = it will hold the size of the array.
x[5]= it will hold the elements in an array.
flag= it will hold the temporary values.
i= it will hold the integer value to control the array.
j= it will hold the integer value to control the array.

Function to print on the terminal/console.

Function to implement the bubble sort.

The main function to perform and navigate the program cleanly.

C Program to implement Selection sort Algorithm

C Program to implement Selection Sort Algorithm

In this tutorial, we will learn to create a C program that will do Selection sorting using C programming.

Prerequisites

Before starting this tutorial we assume that you are best aware of the following C programming topics:-

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-define function in C programming.

What is Selection Sort?

It’s the most simple sorting technique. In this technique, we will select the smallest array element and place it in the first position the second on the second position.

Algorithm

SELECTION SORT(arry, n)  

Step 1: Repeat Steps 2 and 3 for i = 0 to n-1  

Step 2: CALL SMALLEST(arry, i, n, pos)  

Step 3: SWAP arry[i] with arry[pos]  

[END OF LOOP]  

Step 4: EXIT  

  

SMALLEST (arry, i, n, pos)  

Step 1: [INITIALIZE] SET SMALL = arry[i]  

Step 2: [INITIALIZE] SET pos = i  

Step 3: Repeat for j = i+1 to n  

if (SMALL > arry[j])  

     SET SMALL = arry[j]  

SET pos = j  

[END OF if]  

[END OF LOOP]  

Step 4: RETURN pos

SELECTION SORT(arry, n)

Step 1: Repeat Steps 2 and 3 for i = 0 to n-1

Step 2: CALL SMALLEST(arry, i, n, pos)

Step 3: SWAP arry[i] with arry[pos]

[END OF LOOP]

Step 4: EXIT

SMALLEST (arry, i, n, pos)

Step 1: [INITIALIZE] SET SMALL = arry[i]

Step 2: [INITIALIZE] SET pos = i

Step 3: Repeat for j = i+1 to n

if (SMALL > arry[j])

SET SMALL = arry[j]

SET pos = j

[END OF if]

[END OF LOOP]

Step 4: RETURN pos

Program For Selection Sort

#include <stdio.h>  
  
void selection(int arry[], int no)  
{  
    int i, j, smallest;  
    for (i = 0; i < no-1; i++)    
    // Step by Step move boundary of unsorted subarray  
    {  
        smallest = i; 
        //unsorted minimum array element 
        for (j = i+1; j < no; j++)  
        if (arry[j] < arry[smallest])  
            smallest = j;  
// The first element swap with the minimum element of array 
    int flag = arry[smallest];  
    arry[smallest] = arry[i];  
    arry[i] = flag;  
    }  
}  
  
void printArr(int x[], int no) /* function to print the array */  
{  
    int i;  
    for (i = 0; i < no; i++)  
        printf("%d ", x[i]);  
}  
  
int main()  
{  
    int x[] = { 97, 13, 28, 35, 82};  
    int no = sizeof(x) / sizeof(x[0]);  
    printf("Before sorting elements of array - \n");  
    printArr(x, no);  
    selection(x, no);  
    printf("\nAfter sorting elements of array - \n");    
    printArr(x, no);  
    return 0;  
}

#include <stdio.h>

void selection(int arry[], int no)

{

int i, j, smallest;

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

// Step by Step move boundary of unsorted subarray

{

smallest = i;

//unsorted minimum array element

for (j = i+1; j < no; j++)

if (arry[j] < arry[smallest])

smallest = j;

// The first element swap with the minimum element of array

int flag = arry[smallest];

arry[smallest] = arry[i];

arry[i] = flag;

}

void printArr(int x[], int no) /* function to print the array */

{

int i;

for (i = 0; i < no; i++)

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

}

int main()

{

int x[] = { 97, 13, 28, 35, 82};

int no = sizeof(x) / sizeof(x[0]);

printf("Before sorting elements of array - \n");

printArr(x, no);

selection(x, no);

printf("\nAfter sorting elements of array - \n");

printArr(x, no);

return 0;

}

Output:-

In the above program, we have first declared and initialized a set of variables required in the program.

no = it will hold the size of the array.
x[]= it will hold the elements in an array.
flag= it will hold the temporary values.
i= it will hold the integer value to control the array.
j= it will hold the integer value to control the array.

Function to print on the terminal/console.

Function to implement the bubble sort.

The main function to perform and navigate the program cleanly.

C program to implement MERGE sort Algorithm

C Program to Merge sort Algorithm

In this tutorial, we will learn to create a C program that will do Merge sort using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
While loop in C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Merge Sort?

In this technique, we will divide the array into smaller chunks until there is only one element left. Then we will merge the chunks and gets a sorted array.

Algorithm

MERGE_SORT(arr, beg, end)  
  
if beg < end  
set mid = (beg + end)/2  
MERGE_SORT(arr, beg, mid)  
MERGE_SORT(arr, mid + 1, end)  
MERGE (arr, beg, mid, end)  
end of if  
  
END MERGE_SORT

MERGE_SORT(arr, beg, end)

if beg < end

set mid = (beg + end)/2

MERGE_SORT(arr, beg, mid)

MERGE_SORT(arr, mid + 1, end)

MERGE (arr, beg, mid, end)

end of if

END MERGE_SORT

Program For Merge Sort

#include <stdio.h>  
  
/* Merging Sub array of x[] */  
void merge(int x[], int beg, int mid, int end)    
{    
    int i, j, k;  
    int n1 = mid - beg + 1;    
    int n2 = end - mid;    
    int LeftArray[n1], RightArray[n2]; //temporary arrays  
    /* copy data to temp arrays */  
    for (int i = 0; i < n1; i++)    
    LeftArray[i] = x[beg + i];    
    for (int j = 0; j < n2; j++)    
    RightArray[j] = x[mid + 1 + j];    
    i = 0; /* first sub-array initial index */  
    j = 0; /* second sub-array initial index */   
    k = beg;  /* merged sub-array initial index */  
    while (i < n1 && j < n2)    
    {    
        if(LeftArray[i] <= RightArray[j])    
        {    
            x[k] = LeftArray[i];    
            i++;    
        }    
        else    
        {    
            x[k] = RightArray[j];    
            j++;    
        }    
        k++;    
    }    
    while (i<n1)    
    {    
        x[k] = LeftArray[i];    
        i++;    
        k++;    
    }    
    while (j<n2)    
    {    
        x[k] = RightArray[j];    
        j++;    
        k++;    
    }    
}    
void mergeSort(int x[], int beg, int end)  
{  
    if (beg < end)   
    {  
        int mid = (beg + end) / 2;  
        mergeSort(x, beg, mid);  
        mergeSort(x, mid + 1, end);  
        merge(x, beg, mid, end);  
    }  
}  
/* PRinting array function*/  
void printArray(int x[], int no)  
{  
    int i;  
    for (i = 0; i < no; i++)  
        printf("%d ", x[i]);  
    printf("\n");  
}  
int main()  
{  
    int x[] = { 21, 32, 54, 65, 87, 98, 78, 89 };  
    int no = sizeof(x) / sizeof(x[0]);  
    printf("Elements of array before sorting are- \n");  
    printArray(x, no);  
    mergeSort(x, 0, no - 1);  
    printf("Elements of array after sorting are - \n");  
    printArray(x, no);  
    return 0;  
}

#include <stdio.h>

/* Merging Sub array of x[] */

void merge(int x[], int beg, int mid, int end)

{

int i, j, k;

int n1 = mid - beg + 1;

int n2 = end - mid;

int LeftArray[n1], RightArray[n2]; //temporary arrays

/* copy data to temp arrays */

for (int i = 0; i < n1; i++)

LeftArray[i] = x[beg + i];

for (int j = 0; j < n2; j++)

RightArray[j] = x[mid + 1 + j];

i = 0; /* first sub-array initial index */

j = 0; /* second sub-array initial index */

k = beg; /* merged sub-array initial index */

while (i < n1 && j < n2)

{

if(LeftArray[i] <= RightArray[j])

{

x[k] = LeftArray[i];

i++;

}

else

{

x[k] = RightArray[j];

j++;

}

k++;

}

while (i<n1)

{

x[k] = LeftArray[i];

i++;

k++;

}

while (j<n2)

{

x[k] = RightArray[j];

j++;

k++;

}

void mergeSort(int x[], int beg, int end)

{

if (beg < end)

{

int mid = (beg + end) / 2;

mergeSort(x, beg, mid);

mergeSort(x, mid + 1, end);

merge(x, beg, mid, end);

}

/* PRinting array function*/

void printArray(int x[], int no)

{

int i;

for (i = 0; i < no; i++)

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

printf("\n");

}

int main()

{

int x[] = { 21, 32, 54, 65, 87, 98, 78, 89 };

int no = sizeof(x) / sizeof(x[0]);

printf("Elements of array before sorting are- \n");

printArray(x, no);

mergeSort(x, 0, no - 1);

printf("Elements of array after sorting are - \n");

printArray(x, no);

return 0;

}

Output:-

In the above program, we have first declared and initialized a set variables required in the program.

no = it will hold the size of array.
x[]= it will hold the elements in a array.

Subarray sorting merging Function Body:-

i = it will hold the integer value to control the array.
j = it will hold the integer value to control the array.
k= it will hold the integer value to control the array.
LeftArray = it will hold the left array values.
RightArray = it will hold the left array values.

Merge Sorting Function Body:-

Print Array Function body:-

The main function to perform and navigate the program cleanly.

C Program to implement Insertion sort Algorithm

In this tutorial, we will learn to create a C program that will do insertion sort using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Insertion Sort?

In this technique, the work is done by inserting the smaller number to the first position. i.e.

the first and second number is sorted if the number is big then it is moved to the right and if it is small the moves to the left.

Algorithm

The simple steps of insertion sort are as follows -

Step 1 - Let us assume if the element already sorted. Return 1.

Step 2 - Pick the next element store it separately in a key.

Step 3 - Now, compare the key with all elements in the sorted array.

Step 4 - If the element in the sorted array is smaller than the current element, 
         then move to the next element. Else, shift greater elements in the array 
         towards the right.
Step 5 - Insert the value.

Step 6 - Repeat until the array is sorted.

The simple steps of insertion sort are as follows -

Step 1 - Let us assume if the element already sorted. Return 1.

Step 2 - Pick the next element store it separately in a key.

Step 3 - Now, compare the key with all elements in the sorted array.

Step 4 - If the element in the sorted array is smaller than the current element,

then move to the next element. Else, shift greater elements in the array

towards the right.

Step 5 - Insert the value.

Step 6 - Repeat until the array is sorted.

Program For Insertion Sort

#include <stdio.h>  
  
void insert(int x[], int n) 
/* function for sorting an array with insertion sort */  
{  
    int i, j, flag;  
    for (i = 1; i < n; i++) {  
        flag = x[i];  
        j = i - 1;  
  
        while(j>=0 && flag <= x[j]) 
        /* Move the elements greater than flag to one position 
             next from their current position*/  
        {    
            x[j+1] = x[j];     
            j = j-1;    
        }    
        x[j+1] = flag;    
    }  
}  
  
void printArry(int x[], int n) 
/* function to print the array */  
{  
    int i;  
    for (i = 0; i < n; i++)  
        printf("%d ", x[i]);  
}  
  
int main()  
{  
    int x[] = { 54, 65, 21, 32, 87, 98, 78, 89 };  
    int n = sizeof(x) / sizeof(x[0]);  
    printf("Elements of array before sorting are - \n");  
    printArry(x, n);  
    insert(x, n);  
    printf("\nElements of array after sorting are - \n");    
    printArry(x, n);  
  
    return 0;  
}

#include <stdio.h>

void insert(int x[], int n)

/* function for sorting an array with insertion sort */

{

int i, j, flag;

for (i = 1; i < n; i++) {

flag = x[i];

j = i - 1;

while(j>=0 && flag <= x[j])

/* Move the elements greater than flag to one position

next from their current position*/

{

x[j+1] = x[j];

j = j-1;

}

x[j+1] = flag;

}

void printArry(int x[], int n)

/* function to print the array */

{

int i;

for (i = 0; i < n; i++)

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

}

int main()

{

int x[] = { 54, 65, 21, 32, 87, 98, 78, 89 };

int n = sizeof(x) / sizeof(x[0]);

printf("Elements of array before sorting are - \n");

printArry(x, n);

insert(x, n);

printf("\nElements of array after sorting are - \n");

printArry(x, n);

return 0;

}

Output:-

In the above program, we have first declared and initialized a set of variables required in the program.

n = it will hold the size of the array.
x[]= it will hold the elements in an array.

Function to print array:-

Insertion sort function

Main function body

C Program to implement HEAP sort Algorithm

C Program to implement HEAP Sort Algorithm

In this tutorial, we will learn to create a C program that will do HEAP sorting using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Heap Sort?

This technique is opposite to the selection sort technique. Here, we will select the highest value and put it in last, and create a heap for maximum values. This processing is continued till the smallest value is found.

Algorithm

Heap Sort

HeapSort(arry)  
MaxiHeap(arry)  
for i = length(arry) to 2  
    swap arry[1] with arr[i]  
        heap_size[arry] = heap_size[arry] ? 1  
        MaxiHeapify(arry,1)  
End

HeapSort(arry)

MaxiHeap(arry)

for i = length(arry) to 2

swap arry[1] with arr[i]

heap_size[arry] = heap_size[arry] ? 1

MaxiHeapify(arry,1)

End

MaxiHeap (arry)

BuildMaxHeap(arry)  
    heap_size(arry) = length(arry)  
    for i = length(arry)/2 to 1  
MaxHeapify(arry,i)  
End

BuildMaxHeap(arry)

heap_size(arry) = length(arry)

for i = length(arry)/2 to 1

MaxHeapify(arry,i)

End

MaxiHeapify(arry,i)

MaxHeapify(arry,i)  
l = left(i)  
r = right(i)  
if l ? heap_size[arry] and arry[l] > arry[i]  
largest = l  
else  
largest = i  
if r ? heap_size[arry] and arry[r] > arry[largest]  
largest = r  
if largest != i  
swap arry[i] with arry[largest]  
MaxHeapify(arry,largest)  
End

MaxHeapify(arry,i)

l = left(i)

r = right(i)

if l ? heap_size[arry] and arry[l] > arry[i]

largest = l

else

largest = i

if r ? heap_size[arry] and arry[r] > arry[largest]

largest = r

if largest != i

swap arry[i] with arry[largest]

MaxHeapify(arry,largest)

End

Program For Heap Sort

#include <stdio.h>  
/* function for heapifing a subtree. 
Here 'i' is the   
index for the root node in array x[], 
,'no' is the size of heap. */   
void heapify(int x[], int no, int i)  
{  
    int largest = i; //  As a root Initialization of largest 
    int left = 2 * i + 1; // The left child  
    int right = 2 * i + 2; // The right child  
    // The left child is larger than root  
    if (left < no && x[left] > x[largest])  
        largest = left;  
    // The right child is larger than root  
    if (right < no && x[right] > x[largest])  
        largest = right;  
    // The root is not largest  
    if (largest != i) {  
        // swap x[i] with x[largest]  
        int flag = x[i];  
        x[i] = x[largest];  
        x[largest] = flag;  
          
        heapify(x, no, largest);  
    }  
}  
/*Function for implementing the heap sort algo*/  
void heapSort(int x[], int no)  
{  
    for (int i = no / 2 - 1; i >= 0; i--)  
        heapify(x, no, i);  
    // One by one extract an element from heap  
    for (int i = no - 1; i >= 0; i--) {  
        /* Move current root element to end*/  
        // swap x[0] with x[i]  
        int flag = x[0];  
        x[0] = x[i];  
        x[i] = flag;  
          
        heapify(x, i, 0);  
    }  
}  
/* function to print the array elements */  
void printArr(int arr[], int no)  
{  
    for (int i = 0; i < no; ++i)  
    {  
        printf("%d", arr[i]);  
        printf(" ");  
    }  
          
}  
int main()  
{  
    int x[] = { 9, 8, 35, 89, 69, 59, 47, 84, 79};  
    int no = sizeof(x) / sizeof(x[0]);  
    printf("Elements of array before sorting are - \n");  
    printArr(x, no);  
    heapSort(x, no);  
    printf("\nElements of array after sorting are - \n");    
    printArr(x, no);  
    return 0;  
}

#include <stdio.h>

/* function for heapifing a subtree.

Here 'i' is the

index for the root node in array x[],

,'no' is the size of heap. */

void heapify(int x[], int no, int i)

{

int largest = i; // As a root Initialization of largest

int left = 2 * i + 1; // The left child

int right = 2 * i + 2; // The right child

// The left child is larger than root

if (left < no && x[left] > x[largest])

largest = left;

// The right child is larger than root

if (right < no && x[right] > x[largest])

largest = right;

// The root is not largest

if (largest != i) {

// swap x[i] with x[largest]

int flag = x[i];

x[i] = x[largest];

x[largest] = flag;

heapify(x, no, largest);

}

/*Function for implementing the heap sort algo*/

void heapSort(int x[], int no)

{

for (int i = no / 2 - 1; i >= 0; i--)

heapify(x, no, i);

// One by one extract an element from heap

for (int i = no - 1; i >= 0; i--) {

/* Move current root element to end*/

// swap x[0] with x[i]

int flag = x[0];

x[0] = x[i];

x[i] = flag;

heapify(x, i, 0);

}

/* function to print the array elements */

void printArr(int arr[], int no)

{

for (int i = 0; i < no; ++i)

{

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

printf(" ");

}

int main()

{

int x[] = { 9, 8, 35, 89, 69, 59, 47, 84, 79};

int no = sizeof(x) / sizeof(x[0]);

printf("Elements of array before sorting are - \n");

printArr(x, no);

heapSort(x, no);

printf("\nElements of array after sorting are - \n");

printArr(x, no);

return 0;

}

Output:-

In the above program, we have first declared and initialized a set of variables required in the program.

n = it will hold the size of the array.
arr[] = it will hold the value of the array.
x[]= it will hold the elements in an array.

Function to print array:-

Function For Heaping

HEAP sort function

Main function body

C Program to implement Bucket sort Algorithm

In this tutorial, we will learn to create a C program that will do Bucket sort using C programming.

Prerequisites

Before starting with this tutorial we assume that you are best aware of the following C programming topics:

Operators in C Programming.
Basic Input and Output function in C Programming.
Basic C programming.
For loop in C Programming.
Creating and Using the user-defined function in C programming.

What is Bucket Sort?

In this technique, we will create multiple small groups containing a range of elements. Then these groups are back joint again and the sorted array is formed.

Algorithm

Bucket Sort(A[])  
1.  Let B[0....n-1] be a new array  
2.  n=length[A]  
3.  for i=0 to n-1  
4.  make B[i] an empty list  
5.  for i=1 to n  
6.  do insert A[i] into list B[n a[i]]  
7.  for i=0 to n-1  
8.  do sort list B[i] with insertion-sort  
9.  Concatenate lists B[0], B[1],........, B[n-1] together in order  
End

Bucket Sort(A[])

1. Let B[0....n-1] be a new array

2. n=length[A]

3. for i=0 to n-1

4. make B[i] an empty list

5. for i=1 to n

6. do insert A[i] into list B[n a[i]]

7. for i=0 to n-1

8. do sort list B[i] with insertion-sort

9. Concatenate lists B[0], B[1],........, B[n-1] together in order

End

Program For Bucket Sort

#include <stdio.h>  
int getMax(int x[], int no) 
// function for getting maximum element from the given array  
{  
  int max = x[0];  
  for (int i = 1; i < no; i++)  
    if (x[i] > max)  
      max = x[i];  
  return max;  
}  
void bucket(int x[], int no) 
// function for implementing bucket sort  
{  
  int max = getMax(x, no); 
  //max is the maximum element of array  
  int bucket[max], i;  
  for (int i = 0; i <= max; i++)  
  {  
    bucket[i] = 0;  
  }  
  for (int i = 0; i < no; i++)  
  {  
    bucket[x[i]]++;  
  }  
  for (int i = 0, j = 0; i <= max; i++)  
  {  
    while (bucket[i] > 0)  
    {  
      x[j++] = i;  
      bucket[i]--;  
    }  
  }  
}  
void printArr(int x[], int no) 
// function for printing array elements  
{  
  for (int i = 0; i < no; ++i)  
    printf("%d  ", x[i]);  
}  
int main()  
{  
  int x[] = { 79, 99, 12, 66, 3, 8 };  
  int no = sizeof(x) / sizeof(x[0]); 
  // nois the size of array  
  printf("Elenemts of array before sorting are - \n");  
  printArr(x, no);  
  bucket(x, no);  
  printf("\nElenemts of array after sorting are - \n");  
  printArr(x, no);  
}

#include <stdio.h>

int getMax(int x[], int no)

// function for getting maximum element from the given array

{

int max = x[0];

for (int i = 1; i < no; i++)

if (x[i] > max)

max = x[i];

return max;

}

void bucket(int x[], int no)

// function for implementing bucket sort

{

int max = getMax(x, no);

//max is the maximum element of array

int bucket[max], i;

for (int i = 0; i <= max; i++)

{

bucket[i] = 0;

}

for (int i = 0; i < no; i++)

{

bucket[x[i]]++;

}

for (int i = 0, j = 0; i <= max; i++)

{

while (bucket[i] > 0)

{

x[j++] = i;

bucket[i]--;

}

void printArr(int x[], int no)

// function for printing array elements

{

for (int i = 0; i < no; ++i)

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

}

int main()

{

int x[] = { 79, 99, 12, 66, 3, 8 };

int no = sizeof(x) / sizeof(x[0]);

// nois the size of array

printf("Elenemts of array before sorting are - \n");

printArr(x, no);

bucket(x, no);

printf("\nElenemts of array after sorting are - \n");

printArr(x, no);

}

Output:-

In the above program, we have first declared and initialized a set of variables required in the program.

n = it will hold the size of the array.
x[]= it will hold the elements in an array.
i = it will control the for loop for the array.

Function to print array:-

Function for getting the max number.

Bucket sort function.

Main function body.