C program to sort even and odd elements of array separately

Write a C program to input elements in an array from user and sort all even and odd elements of the given array separately without using any other array. If minimum element of the array is even then all even elements should be placed in sorted order before odd elements otherwise all odd elements should be placed first. How to sort all even and odd elements of a given array separately in C programming.

Example:
Input size of array: 10
Input elements of array: 0 5 1 2 3 4 6 12 10 9
Output in sorted order: 0 2 4 6 10 12 1 3 5 9

Required knowledge

Basic C programming, If else, Loop, Array, Functions

Logic to sort even and odd elements separately

Before continuing to this program you must be done with simple sorting of array in ascending order or descending order. Now, coming up to the logic of this program, what we need to do is first to make our task easy we must arrange all elements of array in two parts even and odd (proper sorting of elements are not necessary). Then after arranging all even and odd elements separately sort both parts one by one.

Program to sort even and odd elements separately

/**
 * C program to sort even and odd elements of an array separately
 */
 
#include <stdio.h>
#include <limits.h> //Used for INT_MAX
 
#define MAX_SIZE 1000 //Maximum size of the array
 
 
/*
 * Functions used in this program
 */
void arrange(int arr[], int len, int pivot);
void sort(int arr[], int start, int end);
void print(int arr[], int len);
 
 
 
int main()
{
    int arr[MAX_SIZE], i, n;
    int pivot, evenCount, oddCount;
 
    pivot = 0;
    evenCount = oddCount = 0;
 
    /*
     * Reads size and elements in the array
     */
    printf("Enter size of the array: ");
    scanf("%d", &n);
    printf("Enter elements in the array: ");
    for(i=0; i<n; i++)
    {
        scanf("%d", &arr[i]);
 
        // If current element is odd then increase pivot
        if(arr[i] & 1)
            oddCount++;
        else
            evenCount++;
    } 
    
    /*
     * Pivot is position that separates even and odd elements
     */
    pivot = (evenCount > oddCount) ? evenCount : oddCount;
 
    print(arr, n);
 
    // Arranges all even and odd elements sequentially
    arrange(arr, n, pivot);
    
    // Print elements after arranging even and odd elements
    printf("\nElements after arranging even and odd elements separately\n");
    print(arr, n);
 
    //Sorts even part of the array
    sort(arr, pivot, n);
 
    //Sorts odd part of the array
    sort(arr, 0, pivot);
 
    //Prints the final sorted array
    printf("\nFinal array after sorting even and odd elements separately\n");
    print(arr, n);
 
    return 0;
}
 
 
 
/**
 * Arranges all even and odd elements of the array separately. Puts
 * all even elements first then all odd elements.
 */
void arrange(int arr[], int len, int pivot)
{
    int i, j, temp;
 
    for(i=0; i<pivot; i++)
    {
        /*
         * If current element of array is odd put it into
         * odd element place
         */
        if(arr[i] & 1)
        {
            for(j=pivot; j<len; j++)
            {
                //Look for an even element then swap with odd element
                if(!(arr[j] & 1))
                {
                    temp = arr[j];
                    arr[j] = arr[i];
                    arr[i] = temp;
                    break;
                }
            }
        }
    }
}
 
 
 
/**
 * Sorts the elements of array within a range 
 */
void sort(int arr[], int start, int end)
{
    int i, j, temp;
    int len = start + end;
 
    for(i=start; i<len; i++)
    {
        for(j=i+1; j<len; j++)
        {
            if(arr[j] < arr[i])
            {
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}
 
 
 
/**
 * Prints the entire integer array 
 */
void print(int arr[], int len)
{
    int i;
    printf("Elements in the array: ");
    for(i=0; i<len; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
} 

Happy coding ;)