C Program to Count Odd and Even Elements in an Array.

Problem Statement: Given an array of integers. Your task is to write a C program to count the number of odd and even elements in the array.

• Even Number: A number that is completely divisible by 2.
• Odd Number: A number that is not completely divisible by 2.

Example: 

Input: arr[] = {2, 4, 5, 7, 10}
Output: Even Count = 3
        Odd Count = 2

Input: arr[] = {12, 13, 8, 2, 10}
Output: Even Count = 4
        Odd Count = 1

Algorithm to Count Even and Odd Elements.

Below are the steps that need to follow:

Step 1: Initialize two variables, evenCount and oddCount, to keep track of the count of even and odd elements respectively. Set both counts to zero.

Step 2: Traverse through the array one element at a time.

Step 3: For each element, check if it is even or odd.

Step 4: If the element is even, increment the evenCount by 1.

Step 5: If the element is odd, increment the oddCount by 1.

Step 6: After traversing through the entire array, output the values of evenCount and oddCount.

Program to Count numbers of odd and even elements in an Array.

// C program to count even and odd numbers in the array
#include <stdio.h>

int main() {
    int arr[] = {2, 4, 5, 7, 10};
    //size of given array
    int size = sizeof(arr) / sizeof(arr[0]);
    int evenCount = 0, oddCount = 0;
    
    //check even and odd
    for (int i = 0; i < size; i++) {
        if (arr[i] % 2 == 0) {
            evenCount++;
        } else {
            oddCount++;
        }
    }

    printf("Number of even elements: %d\n", evenCount);
    printf("Number of odd elements: %d\n", oddCount);

    return 0;
}

Output:

Number of even elements: 3
Number of odd elements: 2

Time Complexity: The time complexity of this algorithm is O(n) because it needs to traverse through all the elements of the array once.

Space Complexity: The space complexity of this algorithm is O(1) as it uses a constant amount of extra space to store the loop variable and other variables.

Similar articles:

• C Program to search an element in the Array.
• C Program to find the largest number in the Array.

C Program to Search for a given Element in an Array.

Problem Statement: You are given an array of integers and a target element. Your task is to find if the target element exists in the array or not. Write a C program to search the element.

Example:

Suppose we have an array arr[] = {2, 4, 6, 8, 10}, and the target element is 6. The program should output "Element found" since 6 is present in the array.

Linear Searching Algorithm.

Below is the step-by-step algorithm to search for an element from the given array if exists:

Step 1: Start with the first element of the array and compare it with the target element.

Step 2: If the current element is equal to the target element, return "Element found".

Step 3: If the current element is not equal to the target element, move on to the next element in the array.

Step 4: Repeat steps 2 and 3 until you find the target element or reach the end of the array.

Step 5: If the end of the array is reached and the target element is not found, return "Element not found".

Program to search an element in the given array.

//C program to search an element from the given array
#include <stdio.h>

int searchElement(int arr[], int size, int target) {
    for (int i = 0; i < size; i++) {
        if (arr[i] == target) {
            return 1; // Element found
        }
    }
    return 0; // Element not found
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 6;

    if (searchElement(arr, size, target)) {
        printf("Element found\n");
    } else {
        printf("Element not found\n");
    }

    return 0;
}

Output:

Element found

Time Complexity: The time complexity of this algorithm is O(n) because, in the worst-case scenario, we might have to check all the elements of the array to find the target element.

Space Complexity: The space complexity of this algorithm is O(1) as it uses a constant amount of extra space to store the loop variable and other variables.

C Program to Reverse the Elements of an Array.

Problem Statement: Given an array of integers, write a C program to reverse the elements of the array in place. 

Note: In-place means without using any additional data structure to store the reverse elements. The original array is updated to contain its elements in reverse order, without creating a new array to hold the reversed elements. 

Example:

Input: arr[] = {10, 20, 30, 40, 50}
Output: Reversed array: {50, 40, 30, 20, 10}

Algorithm to Reverse Array Elements.

Below are the steps that we need to follow:

Step 1: Take the size of the array and create an array arr of that size.

Step 2: Input the elements of the array arr.

Step 3: Initialize two variables, start with 0 and end to the size of the array minus 1.

Step 4: Swap the elements at start and end indexes and increment start and decrement end until the start becomes greater than or equal to the end.

Step 5: Print the reversed array.

Program to Reverse the Elements of an Array.

// C program to reverse array elements in-place 
#include <stdio.h>

// Function to swap two elements
void swap(int* a, int* b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int main() {
    int n;

    printf("Enter the size of the array: ");
    scanf("%d", &n);

    int arr[n]; 

    // Input the elements of the array
    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    int start = 0;
    int end = n - 1;

    while (start < end) {
        swap(&arr[start], &arr[end]);
        start++;
        end--;
    }

    printf("Reversed array: {");
    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if (i < n - 1) {
            printf(", ");
        }
    }
    printf("}\n");

    return 0;
}

Output:

Enter the size of the array: 5
Enter the elements of the array:
11 10 9 20 8
Reversed array: {8, 20, 9, 10, 11}

Time Complexity: The time complexity of this code is O(n) because we need to traverse through the entire array once to reverse the elements.

Space Complexity: The space complexity of this code is O(1) because we are not using any extra space to solve this problem.

Reverse the Elements of the Array Using Recursion.

We can also reverse the order of the elements stored in the given array by using the Recursive method. 

Algorithm:

1. Base Case: If the array is empty or has only one element, it is already reversed.

2. Recursive Case:

• Swap the first and last elements of the array.
• Recursively reverse the remaining subarray.

C Program to Reverse Array Using Recursion.

// C code to reverse order of an array using recursive method
#include <stdio.h>

// Function to swap two elements
void swap(int *a, int *b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

// Recursive function to reverse an array
void reverseArray(int arr[], int start, int end) {
    // Base case: if the array is empty or has only one element
    if (start >= end) {
        return;
    }

    // Swap the first and last elements
    swap(&arr[start], &arr[end]);

    // Recursively reverse the remaining subarray
    reverseArray(arr, start + 1, end - 1);
}

// Function to print an array
void printArray(int arr[], int size) {
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("Original array: ");
    printArray(arr, n);

    // Reverse the array
    reverseArray(arr, 0, n - 1);

    printf("Reversed array: ");
    printArray(arr, n);

    return 0;
}

Output:

Original array: 1 2 3 4 5
Reversed array: 5 4 3 2 1

• Time Complexity: O(n)
• Space Complexity: O(1)

Similar articles:

• C Program to Find the Largest Element of the Array.
• C Program to Find the Smallest Element of the Array.

C Program to Find the Smallest element in an Array.

Problem Statement: Given an array of integers, write a C program to find the smallest element in the array. 

Example:

Input: arr[] = {12, 45, 67, 32, 90, 3}
Output: Smallest element: 3

Input: arr[] = {11, 15, 17, 22, 9, 10}
Output: Smallest element: 9

Algorithm to Find Smallest Element in an Array.

Below are the steps that we need to follow:

Step 1: Initialize a variable min to store the smallest element and set it to the first element of the array.

Step 2: Input the size of the array and create an array arr of that size.

Step 3: Input the elements of the array arr.

Step 4: Traverse through the array from the second element to the last element.

• If the current element is smaller than min, update the value of min to the current element.

Step 5: Print the value of min.

Program to Find the Smallest Element from Given Array.

//C program to find smallest element of the array
#include <stdio.h>

int main() {
    int n, min;

    printf("Enter the size of the array: ");
    scanf("%d", &n);

    int arr[n]; 

    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Initialize 'min' to the first element of the array.
    min = arr[0];

    // Traverse to find the smallest element.
    for (int i = 1; i < n; i++) {
        if (arr[i] < min) {
            min = arr[i];
        }
    }

    printf("Smallest element: %d\n", min);

    return 0;
}

Output:

Enter the size of the array: 5
Enter the elements of the array:
12 3 9 10 22
Smallest element: 3

Time Complexity: The time complexity of this code is O(n) since we need to traverse through the entire array once to find the smallest element.

Space Complexity: The space complexity of this code is O(1) because we are not using any extra space to find the minimum element.

Related articles:

• C Program to Find Sum of all Array Elements.
• C Program to Find the Largest Element of the Array.

C Program to Find the Largest element in an array.

Problem Statement: Given an array of integers, write a C program to find the largest element in the array.

Example:

Input: arr[] = {12, 45, 67, 32, 90, 3}
Output: Largest element: 90

Input: arr[] = {10, 9, 12, -6, 11}
Output: Largest element: 11

Algorithm to Find Largest Element from Array.

Below are the steps that we need to follow:

Step 1: Initialize a variable max to store the largest element and set it to the first element of the array.

Step 2: Input the size of the array and create an array arr of that size.

Step 3: Take the elements of the array arr from the user.

Step 4: Traverse through the array from the second element to the last element.

• If the current element is greater than max, update the value of max to the current element.

Step 5: Print the value of max.

Program to Find the Largest Element of the Array.

//C program to find largest element of the array
#include <stdio.h>

int main() {
    int n, max;

    printf("Enter the size of the array: ");
    scanf("%d", &n);
    // Creating an array of size 'n'.
    int arr[n]; 

    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Initialize 'max' to the first element of the array.
    max = arr[0];

    // Traverse to find the largest element.
    for (int i = 1; i < n; i++) {
        if (arr[i] > max) {
            max = arr[i];
        }
    }

    printf("Largest element: %d\n", max);

    return 0;
}

Output:

Enter the size of the array: 6
Enter the elements of the array:
11 23 10 31 9 12
Largest element: 31

Time Complexity: The time complexity of this code is O(n) since we need to traverse through the entire array once to find the largest element.

Space Complexity: The space complexity of this code is O(1) because we are not using any extra space to find the smallest elements of the input array.

Similar articles:

• C Program to Find the Sum of Array Elements.
• C Program to Find the Smallest Elelemt of the Array. 

C Program to Find Sum of Array Elements.

Problem Statement: Given an array of integers, write a C program to find the sum of all elements in the array.

Example:

Input: arr[] = {1, 2, 3, 4, 5}
Output: Sum of elements: 15

Algorithm to find the Sum of Array Elements.

Below are the steps that we need to follow:

Step 1: Initialize a variable sum to 0 to store the sum of elements.

Step 2: Input the size of the array and create an array arr of that size.

Step 3: Input the elements of the array arr.

Step 4: Traverse through the array from the first element to the last element.

• Add each element to the sum variable.

Step 5: Print the value of the sum.

Program to Find Sum of Array Elements.

//C program to find sum of array elements
#include <stdio.h>

int main() {
    int n, sum = 0;

    printf("Enter the size of the array: ");
    scanf("%d", &n);
    
    // Creating an array of size 'n'.
    int arr[n]; 

    // Input the elements of the array 'arr'.
    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // calculate the sum of elements.
    for (int i = 0; i < n; i++) {
        sum += arr[i];
    }

    printf("Sum of elements: %d\n", sum);

    return 0;
}

Output:

Enter the size of the array: 5
Enter the elements of the array:
12 10 5 2 9
Sum of elements: 38

Time Complexity: The time complexity of this code is O(n) since we need to traverse through the entire array once to calculate the sum.

Space Complexity: The space complexity of this code is O(1) because we are not using any extra space to solve this problem except for storing the elements of the input array.

Similar articles:

• C Program to Find the Largest Element of the Array.
• C Program to Find the Smallest Element of the Array.

C Programming Examples.

Welcome to the world of C programming! If you are just starting your journey in the realm of programming or looking to sharpen your coding skills, you have come to the right place. This article page is dedicated to providing you with a diverse collection of C program examples to practice and master the language.

C Programs - Basic.

👉 Hello World Program in C.

👉 C Program Input/Output Operation.

👉 C Program to Add Two Integer Numbers.

👉 C Program to Find the ASCII value of a Character.

👉 C Program to Swap Two Numbers. 

👉 C Program to Find Quotient and Remainder.

👉 C Program to Calculate Fahrenheit to Celsius and vice-versa.

👉 C program to Add Two Complex Numbers.

👉 C Program to Find the Size of int, float, char, and double.

👉 C Program to Calculate Simple Interest.

👉 C Program to Calculate Compound Interest.

👉 C Program to Find Area of a Circle.

C Program - Control Follow.

👉 C Program to Find Greatest Number Among Three.

👉 C Program to Check Whether the Number is Even or Odd.

👉 C Program to Count Vowel and Consonant.

👉 C Program to Check Leap Year.

👉 C Program to Print Sum of Natural Numbers.

👉 C Program to Find Factorial of a Number.

👉 C Program to Print Fabanocci Series.

👉 C Program to Check Armstrong Number.

👉 C Program to Check Palindrome Number.

👉 C Program to Check if a number is prime or not.

👉 C Program to Find GCD for two numbers.

👉 C Program to Reverse a Number.

👉 C Program to Create a Calculator.

👉 C Program to Generate Multiplication Table.

Conversion Programs in C.

👉 C Program to Convert Binary to Octal.

👉 C Program to Convert Octal to Binary.

👉 C Program to Convert Binary to Decimal.

👉 C Program to Convert Octal to Decimal.

Patterns Programs in C.

👉 C Program to Print Pyramid Patterns.

👉 C Program to Print Dymond Patterns.

C Program - Arrays.

👉 C Program to Find Sum of Array Elements.

👉 C Program to Find the Largest Element in an array.

👉 C Program to Find the Smallest Element in an Array.

👉 C Program to Reverse the Elements of an Array.

👉 C Program to Search for a Given Element in an Array.

👉 C Program to Count Number of Odd and Even Elements in an Array.

👉 C Program to Find and Display duplicate elements in an array.

👉 C Program to Calculate Average of All the Elements of an Array.

C Program - String.

👉 C Program to Find Length of a String.

👉 C Program to Copy One String to Another String.

👉 C Program to concatenate two strings.

👉 C Program to Compare Two Strings.

👉 C Program to Reverse Given String.

C Program to Check Palindrome Number.

In this C programming tutorial, we will learn how to check if the given number is a palindrome number or not. Before moving to the code section let us understand what is Palindrome number?

Palindrome Number.

A palindrome number is a number that reads the same backward as forward. In other words, the digits of a palindrome number remain unchanged when read from left to right and from right to left. 

Example: 121, 454, and 12321 are palindrome numbers.

Algorithm to Check Palindrome Number.

Step 1: Input the number from the user.

Step 2: Create a copy of the original number to compare later.

Step 3: Initialize variables to store the reverse of the number and the remainder.

Step 4: Use a loop to reverse the digits of the number:

• a) Extract the last digit of the number using the modulus (%) operator.
• b) Add the last digit to the reversed number after moving the previous digits one place left using multiplication (*= 10).
• c) Remove the last digit from the original number using integer division ( /= 10).
• d) Repeat the above steps until the original number becomes 0.

Step 5: Compare the reversed number with the copy of the original number.

Step 6: If the reversed number is equal to the original number, it is a palindrome. Otherwise, it is not.

Program to Check Palindrome Number.

// c code implementation to check palindrome number
#include <stdio.h>

int main() {
    int num, originalNum, reversedNum = 0, remainder;

    printf("Enter an integer: ");
    scanf("%d", &num);

    originalNum = num;

    // Reverse the number
    while (num != 0) {
        remainder = num % 10;         
        reversedNum = reversedNum * 10 + remainder;   
        num /= 10;                    
    }

    // Compare with the original number
    if (reversedNum == originalNum) {
        printf("%d is a palindrome number.\n", originalNum);
    } else {
        printf("%d is not a palindrome number.\n", originalNum);
    }

    return 0;
}

Output:

Enter an integer: 12321
12321 is a palindrome number.

Time Complexity: O(n) where n is the number of digits present in the given number.

Space Complexity: O(1) no extra space is required to solve this problem.

Similar articles:

(getButton) #text=(C Program to Check Armstrong Number) #icon=(link) #color=(#2339bd)

(getButton) #text=(C Program to Print Fibonacci Series) #icon=(link) #color=(#2339bd)